Apparatus and method of a distributed capital system

ABSTRACT

A method conducting financial transactions over a computerized network, which includes conducting awareness propagation such that capital movement over a participant system-network is optimized.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Divisional Application of U.S. patent applicationSer. No. 13/493,707 filed Jun. 11, 2012, which is a DivisionalApplication of U.S. patent application Ser. No. 12/458,674, filed Jul.20, 2009, now U.S. Pat. No. 8,224,744, which is a Divisional Applicationof U.S. patent application Ser. No. 10/366,446, filed Feb. 14, 2003, nowU.S. Pat. No. 7,590,595, which claims priority from U.S. ProvisionalPatent Application No. 60/356,148, filed Feb. 14, 2002, and from U.S.Provisional Patent Application No. 60/439,797, filed Jan. 14, 2003, thecontents of all of which are herein incorporated by reference in theirentirety.

The present invention relates generally to an apparatus and method of anautomated distributed finance or capital system which can perform aplurality of financial transactions over a global computerized network.

BACKGROUND OF THE INVENTION

In financial services, geography is a formidable barrier, especiallywhen the geographic distance (time-difference) is compounded bycurrency, legal, and political domain differences. Despite all theclaims of future horizons and full systemization of the world economy,straight through processing and streamlined operations, there is stillno organization delivering an architecture specifically designed tohandle integrated global financial services.

SUMMARY OF THE INVENTION

The present invention relates to an apparatus and method of an automateddistributed capital system which can perform a plurality of financialtransactions over a global computerized network.

In particular, the distributed capital system (DCS) of the presentinvention can manage transactions that fall under two broad categories:Traditional (Individual), and Collaborative (Multiparty). These twocategories cover the transaction spectrum, and the DCS of the presentinvention detailed herein covers the assembly, testing, execution, andmanagement of transaction events (such as bill payment, foreign currencyexchange etc.), which are unique.

Specifically, the DCS of the present invention handles, among othertransactions: bill payment structuring, management, and execution;invoicing structuring, management and execution; funds transferinitiation and management; distributed (dispersed) funds transfer (DFT)initiation and management, including repatriation of funds withoutinternational transfer; direct exchange of fungible units, whethersymmetric (i.e., parties on each side of transaction hold equivalentvalue, to be exchanged in full with opposite counterparty) or asymmetric(parties on each side of transaction hold different valueamounts)—specifically currencies, between parties worldwide (withoutintermediary brokers or 3^(rd) party financial institutions); automatedforeign exchange market; programmed credit card payment scheduling;avoidance of the payment of ATM fees worldwide; on-line purchasingtransactions in different currencies without requiring traditionalcurrency-exchange transaction; a consumer credit and direct lendingsystem; a distributed credit-rating system; a syndication system thathandles micro-to-massive amounts from unlimited participants; andprogrammed speculative investing individually or in collaboration withothers.

Specifically, aspects of the present invention relate to an automateddistributed capital system that can perform a plurality of financialtransactions over a computer network, such as the Internet. Thedistributed capital system (DCS) of the present invention manages anytype of financial transaction between any number of parties. Therefore,for example, if a party desires to execute a financial transaction for acertain monetary or exchange value and the first counter-party cannotexecute the transaction for the full monetary or exchange value, the DCSof the present invention automatically obtains additionalcounter-parties until the transaction can be fully executed.Accordingly, as long as there is enough value distributed among thevarious parties on the network, the DCS of the present invention canexecute financial transactions for any value.

The party initiating the financial transaction can choose thecounter-parties or the DCS of the present invention can automaticallyobtain those counter-parties. Further, the counter-parties can belocated anywhere on the network. Therefore, if the network is forexample the Internet, methods and systems consistent with the presentinvention are not limited to geographical boundaries. The DCS of thepresent invention can execute transactions between parties in variouscountries, and automatically exchange the respective exchangecurrencies.

Accordingly, the distributed capital system allows any number of partiesto collaboratively transact any amount of value with any number ofcounter-parties, arranging for independently market-driven rates andterms and handling the transfer of value. This is performed without, forexample, an intermediary such as a broker.

Since there can be any number of parties and counter-parties, the DCScan execute financial transactions involving, for example, a singleparty and a single counter-party (traditional simple), a single partyexecuting several traditional simple transactions at the same time(traditional compound), a single party and multiple counter-parties(collaborative simple), and multiple parties and multiplecounter-parties (collaborative compound).

In accordance with methods consistent with the present invention, amethod in a data processing system having a program is provided. Thedata processing system is connected to at least one of a plurality ofremote data processing systems via a network. The method comprises thesteps performed by the program of: receiving from a user a request toexecute at least one financial transaction with at least one of aplurality of parties, each of the parties corresponding to one of thedata processing systems; obtaining real-time financial informationrelating to the financial transaction; and confirming that the financialtransaction can be executed with at least one party.

In accordance with methods consistent with the present invention, amethod in a data processing system having a program is provided. Thedata processing system is connected to at least one of a plurality ofremote data processing systems via a network. The method comprises thesteps performed by the program of: receiving from a user a request toexecute at least one financial transaction with at least one of aplurality of parties, each of the parties corresponding to one of thedata processing systems; obtaining real-time financial informationrelating to the financial transaction; determining a monetary orexchange value of the financial transaction; determining whether the atleast one party that will execute the financial transaction for themonetary or exchange value; and confirming that the financialtransaction can be executed with additional parties to the at least oneparty until a total monetary or exchange value for which the partieswill execute the financial transaction is equal to the determinedmonetary or exchange value of the financial transaction responsive tothe identified at least one party not executing the financialtransaction for the monetary or exchange value.

In accordance with articles of manufacture consistent with the presentinvention, a computer-readable medium containing instructions that causea data processing system to perform a method is provided. The dataprocessing system is connected to at least one of a plurality of remotedata processing systems via a network. The method comprises the stepsperformed by the program of: receiving from a user a request to executeat least one financial transaction with at least one of a plurality ofparties, each of the parties corresponding to one of the data processingsystems; obtaining real-time financial information relating to thefinancial transaction; and confirming that the financial transaction canbe executed with at least one party.

In accordance with articles of manufacture consistent with the presentinvention, a computer-readable medium containing instructions that causea data processing system to perform a method is provided. The dataprocessing system is connected to at least one of a plurality of remotedata processing systems via a network. The method comprises the stepsperformed by the program of: receiving from a user a request to executeat least one financial transaction with at least one of a plurality ofparties, each of the parties corresponding to one of the data processingsystems; obtaining real-time financial information relating to thefinancial transaction; determining a monetary or exchange value of thefinancial transaction; determining whether the at least one party thatwill execute the financial transaction for the monetary or exchangevalue; and confirming that the financial transaction can be executedwith additional parties to the at least one party until a total monetaryor exchange value for which the parties will execute the financialtransaction is equal to the determined monetary or exchange value of thefinancial transaction responsive to the identified at least one partynot executing the financial transaction for the monetary or exchangevalue.

In accordance with systems consistent with the present invention, a dataprocessing system connected to at least one of a plurality of remotedata processing systems via a network is provided. The data processingsystem comprises: means for receiving from a user a request to executeat least one financial transaction with at least one of a plurality ofparties, each of the parties corresponding to one of the data processingsystems; means for obtaining real-time financial information relating tothe financial transaction; and means for confirming that the financialtransaction can be executed with at least one party.

In accordance with systems consistent with the present invention, a dataprocessing system connected to at least one of a plurality of remotedata processing systems via a network is provided. The data processingsystem comprises: means for receiving from a user a request to executeat least one financial transaction with at least one of a plurality ofparties, each of the parties corresponding to one of the data processingsystems; means for obtaining real-time financial information relating tothe financial transaction; means for determining a monetary or exchangevalue of the financial transaction; means for determining whether the atleast one party that will execute the financial transaction for themonetary or exchange value; and means for confirming that the financialtransaction can be executed with additional parties to the at least oneparty until a total monetary or exchange value for which the partieswill execute the financial transaction is equal to the determinedmonetary or exchange value of the financial transaction responsive tothe identified at least one party not executing the financialtransaction for the monetary or exchange value.

In accordance with systems consistent with the present invention, a dataprocessing system connected to at least one of a plurality of remotedata processing systems via a network is provided. The data processingsystem comprises: a memory comprising a program that receives from auser a request to execute at least one financial transaction with atleast one of a plurality of parties, each of the parties correspondingto one of the data processing systems, obtains real-time financialinformation relating to the financial transaction, and confirms that thefinancial transaction can be executed with at least one party; and aprocessing unit that runs the program.

In accordance with systems consistent with the present invention, a dataprocessing system connected to at least one of a plurality of remotedata processing systems via a network is provided. The data processingsystem comprises: a memory comprising a program that receives from auser a request to execute at least one financial transaction with atleast one of a plurality of parties, each of the parties correspondingto one of the data processing systems, obtains real-time financialinformation relating to the financial transaction, determines a monetaryor exchange value of the financial transaction, determines whether theat least one party that will execute the financial transaction for themonetary or exchange value, and confirms that the financial transactioncan be executed with additional parties to the at least one party untila total monetary or exchange value for which the parties will executethe financial transaction is equal to the determined monetary orexchange value of the financial transaction responsive to the identifiedat least one party not executing the financial transaction for themonetary or exchange value; and a processing unit that runs the program.

In accordance with articles of manufacture consistent with the presentinvention, a computer-readable memory device encoded with a programhaving a data structure is provided. The program is run by a processorin a data processing system connected to at least one of a plurality ofremote data processing systems via a network. The data structure has aplurality of entries, each entry comprising: a first storage area thatstores a monetary or exchange value of a financial transaction; and aplurality of second storage areas that each store an identity of a partyto the financial transaction and an amount for which the party willexecute the financial transaction, the program confirming additionalparties and amounts for which the additional eligible parties willexecute the financial transaction until a total amount for which theparties will execute the financial transaction is equal to the monetaryor exchange value.

There has thus been outlined, some features consistent with the presentinvention in order that the detailed description thereof that followsmay be better understood, and in order that the present contribution tothe art may be better appreciated. There are, of course, additionalfeatures consistent with the present invention that will be describedbelow and which will form the subject matter of the claims appendedhereto.

In this respect, before explaining at least one embodiment consistentwith the present invention in detail, it is to be understood that theinvention is not limited in its application to the details ofconstruction and to the arrangements of the components set forth in thefollowing description or illustrated in the drawings. Methods andapparatuses consistent with the present invention are capable of otherembodiments and of being practiced and carried out in various ways.Also, it is to be understood that the phraseology and terminologyemployed herein, as well as the abstract included below, are for thepurpose of description and should not be regarded as limiting.

As such, those skilled in the art will appreciate that the conceptionupon which this disclosure is based may readily be utilized as a basisfor the designing of other structures, methods and systems for carryingout the several purposes of the present invention. It is important,therefore, that the claims be regarded as including such equivalentconstructions insofar as they do not depart from the spirit and scope ofthe methods and apparatuses consistent with the present invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram showing a client-server environment,according to one embodiment consistent with the present invention.

FIG. 2 is a schematic diagram showing a distributed network environment,according to one embodiment consistent with the present invention.

FIG. 3 is a schematic diagram showing more detail of the client and theserver in a client-server environment, according to one embodimentconsistent with the present invention.

FIG. 4 is a diagram showing a balanced request with single mean by theSpread-Vector Resolution program module in fulfilling a financialtransaction, according to one embodiment consistent with the presentinvention.

FIG. 5 is a diagram showing a balanced request with multiple means bythe Spread-Vector Resolution program module for fulfilling a financialtransaction, according to one embodiment consistent with the presentinvention.

FIG. 6 is a diagram showing an asymmetric matching being processed bythe Spread-Vector Resolution program module for fulfilling a financialtransaction, according to one embodiment consistent with the presentinvention.

FIG. 7A is a diagram showing an all-seek opposite-side match beingprocessed by the Spread-Vector Resolution program module for fulfillinga financial transaction, according to one embodiment consistent with thepresent invention.

FIG. 7B is a diagram showing a capital infusion into the system to bemade available to the Spread-Vector Resolution program module, accordingto one embodiment consistent with the present invention.

FIGS. 8A and 8B show Spread-Vector Netting according to one embodimentconsistent with the present invention.

FIG. 9 shows the function of the Code Division Multiple Transactionprogram module according to one embodiment consistent with the presentinvention.

FIG. 10 shows the function of the Code Division Multiple Transactionprogram module according to one embodiment consistent with the presentinvention.

FIGS. 11A and 11B depict a flowchart which shows the operation of theTraditional Simple transaction according to one embodiment consistentwith the present invention.

FIG. 12 is a screen shot of the Transaction Workpad of the userinterface according to one embodiment consistent with the presentinvention.

FIG. 13 is a screen shot of the Transaction Workpad of the userinterface according to one embodiment consistent with the presentinvention.

FIG. 14 is a screen shot of an unassembled Traditional Simpletransaction on the Transaction Workpad of the user interface accordingto one embodiment consistent with the present invention.

FIG. 15 is a screen shot of an assembled Traditional Simple transactionon the Transaction Workpad of the user interface according to oneembodiment consistent with the present invention.

FIG. 16 is a screen shot of a transaction syntax approved TraditionalSimple transaction according to one embodiment consistent with thepresent invention.

FIG. 17 is a screen shot of a real-time simulated execution dataattendant to a Traditional Simple transaction according to oneembodiment consistent with the present invention.

FIG. 18 is a screen shot of an assembled Traditional Compoundtransaction according to one embodiment consistent with the presentinvention.

FIG. 19 is a screen shot of an assembled Collaborative Simpletransaction according to one embodiment consistent with the presentinvention.

FIG. 20 is a flowchart of a method of conducting a CollaborativeCompound transaction according to one embodiment consistent with thepresent invention.

FIG. 21A is a table showing a macro ledger kept by the Code DivisionMultiple Transaction program module in a Collaborative Compoundtransaction according to one embodiment consistent with the presentinvention.

FIG. 21B is a diagram showing the parties to a Collaborative Compoundtransaction being processed by the Spread-Vector Resolution programmodule according to one embodiment consistent with the presentinvention.

FIG. 21C is a table showing a macro ledger empirically reduced, which iskept by the Code Division Multiple Transaction program module in aCollaborative Compound transaction according to one embodimentconsistent with the present invention.

FIGS. 22A-22D are diagrams showing four major types of transactions.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Methods and systems consistent with the present invention makes possibleautomated distributed financial services available over a globalcomputerized network. Among other things, the system of the presentinvention allows individuals to collaboratively lend (any particulateamount) to any person or company and arrange for independentlymarket-driven rates and terms, and then also allowing the system tohandle repayment distributions. A distributed capital system convertscurrencies without a broker, at any amount desired, and matchescounterparties for equities, bond or other fungible-instrument tradesfaster and cheaper than traditional methods. The distributed capitalsystem consistent with the present invention includes the concepts ofscalability, network-effect, and open community.

Methods and systems consistent with the present invention include anexpansive system designed to support network collaborative transactionservices. Since this collaborative format is more sophisticated andrequires more system architecture than conventional systems, currenttransaction structures (one-to-one commerce relationships) are enabledas a subset of the functionality of the collaborative embodiment of thepresent invention.

System Architecture

One embodiment of the present invention is now discussed with referenceto the Figures which depicts a financial system suitable for practicingmethods and systems consistent with the present invention.

The present invention may be carried out in a client-server environment(see FIG. 1), or may be carried out in a distributed environment, whereonly client computers are utilized (see FIG. 2). Thus, in the presentinvention, a particular operation or service may be performed either atthe client or the server, at the edge of a network or at center, orboth. Therefore, at either the client or the server, or both,corresponding programs for a desired operation/service are available. Inthe present invention, even though a pair of corresponding programs atthe client and the server, respectively, perform the same operationsfrom the viewpoint of the user, they may execute different operationsinternal to the systems, including having operations performedcompletely at client computers in a distributed financial network, asshown in FIG. 2.

More particularly, in the distributed financial network of the presentinvention, every node on the network has a set of closest neighbors, andeach node shares its awareness-universe with its neighbors. Thus, aquery can be autonomously related back to the requesting party. Thepresent invention terms this an “awareness propagation”. Thus, theoperations of the present invention can be provided solely by clientcomputers as shown in FIG. 2.

However, at least one client computer, and perhaps, at least one servercomputer, may preferably be used to practice the methods and systemsconsistent with the present invention.

In the client-server environment, at least one client and at least oneserver are each connected to a network (see FIG. 1), such as a LocalArea Network (LAN), Wide Area Network (WAN), and/or the Internet, over acommunication link. The steps in the methods consistent with the presentinvention, are carried out at the client or at the server, or at both,the server, if used, being accessible by the client over, for example,the Internet, using a browser application or the like.

Specifically, the client shown in FIGS. 1-3, may be a personal computer,a mobile terminal, such as a mobile computing device, a mobile phone, ora mobile data organizer, operated by the user in accessing the financialservices remote from the client (i.e., at the server). Even though onlytwo clients are shown in FIG. 1, one of ordinary skill in the art wouldbe aware that there may be a plurality of similar clients connected toother clients or servers.

The client computer 10, as shown in FIG. 3, typically includes aprocessor 11 as a client data processing means or mechanism, theprocessor 11 including a central processing unit (CPU) 12 and aninput/output (I/O) interface 13, a memory 14 with program 15 having adata structure 16, all connected by a bus 17, as well as an input deviceor means 18, a display 19, and may also include a secondary storagedevice 20. The bus 17 may be internal to the client 10 and may includean adapter to a keyboard or input device 18, or may include externalconnections.

The data structure 16 may include a plurality of entries, each entryincluding at least a first storage area that stores a monetary orexchange value of a financial transaction, and a plurality of secondstorage areas that each store an identity of a party to the financialtransaction and an amount for which the party will execute the financialtransaction, the program confirming additional parties and amounts forwhich the additional eligible parties will execute the financialtransaction until a total amount for which the parties will execute thefinancial transaction is equal to the monetary or exchange value. Thedata structure can also have alternative embodiments including thatassociated with the match codes or other stored information as one ofordinary skill in the art would appreciate from the followingdescriptions.

In methods and systems consistent with the present invention, the client10 is connected to other clients 10 or servers 30 via a communicationlink 21 as a client communication means or mechanism, using acommunication end port specified by an address or a port, and thecommunication link may include a mobile communication link, a switchedcircuit communication link, or may involve a network of data processingdevices such as a LAN, WAN, the Internet, or combinations thereof. Thecommunication link 21 may be an adapter unit capable to execute variouscommunications protocols in order to establish and maintaincommunication with the server 30. The communication link 21 may beconstituted by a specialized piece of hardware or may be realized by ageneral CPU executing corresponding program instructions. Thecommunication link 21 may be at least partially included in theprocessor 11 executing corresponding program instructions.

The processor 11 at the client 10 may be internal or external thereto,and executes a program 15 adapted to predetermined operations. Theprocessor 11 has access to the memory 14 in which may be stored at leastone sequence of code instructions comprising the program 15 and the datastructure 16 for performing predetermined operations. The memory 14 andprogram 15 may be located within the client 10 or external thereto.

The program 15 can include a separate program code for performing adesired operation or service, or be part of a module of a larger programproviding the service. The program 15 may also include a plurality ofmodules performing sub-operations of a service, as described furtherbelow.

It is understood that the processor 11 may be adapted to access and/orexecute a plurality of programs 15 corresponding to a plurality ofservices/operations.

An operation or service rendered by the program 15 may be, for example,supporting the user interface, performing e-mail applications, settingup financial transactions, etc.

The input means 18 of the client 10 may include standard input devicessuch as a keyboard, mouse, or a speech processing means.

The storage device 20 stores at least one data file, such as text files,data files, image, audio, video files etc., in providing a particularservice for a user. The data storage device as storage means 20, may befor example, a database, including a distributed database connected viaa network 22, for example. The storage device 20 may be connected to theserver 30 and/or the client 10, either directly or through acommunication network, such as a LAN or WAN. An internal storage device,such as 20, or an external storage device 23 is optional, and data mayalso be received via, for example, a network 22, and directly processed.

If a server 30 is used in a non-distributed environment, the server 30would include a processor 24, having a CPU 25 which is a server dataprocessing means or mechanism and an I/O interface 26, but may also beconstituted by a distributed CPU 25 including a plurality of individualprocessors 24 on one or a plurality of machines. The processor 24 of theserver 30 may be a general data processing unit, but preferably a dataprocessing unit with large resources, i.e., high processing capabilitiesand a large memory for storing large amounts of data.

The server 30 also includes a memory 27 with program 28 having a datastructure 29, all connected by a bus 31. The bus 31 or similarconnection line can also consist of external connections, if the server30 is constituted by a distributed system. The server processor 24 mayhave access to a storage device (i.e., storage device 32) for storingpreferably large numbers of programs for providing various services tothe users, i.e., for performing various financial operations as desiredby users operating clients 10.

The data structure 29 may include a plurality of entries, each entryincluding at least a first storage area that stores a monetary orexchange value of a financial transaction, and a plurality of secondstorage areas that each store an identity of a party to the financialtransaction and an amount for which the party will execute the financialtransaction, the program confirming additional parties and amounts forwhich the additional eligible parties will execute the financialtransaction until a total amount for which the parties will execute thefinancial transaction is equal to the monetary or exchange value. Thedata structure can also have alternative embodiments including thatassociated with the match codes or other stored information as one ofordinary skill in the art would appreciate from the followingdescriptions.

The server 30 may be a single unit or may be a distributed system of aplurality of servers 30 or data processing units, and may be shared bymultiple users in direct or indirect connection to each other. Theserver 30 performs at least one server program 28 for a desiredoperation, which is required in serving a request from the client 10.

The communication link 33 from the server 30 is preferably adapted tocommunicate with a plurality of clients 10.

The server program 28 may relate to providing a number of operationsrelated to providing financial services to a user, such as allowing auser to assemble a financial transaction, to test a proposed financialtransaction, to ensure that each transaction request is codestamped witha unique transaction number and tracked securely through the financialsystem, etc.

Note that at times the system of the present invention is described asperforming a certain function. However, one of ordinary skill in the artwould know that the program is what is performing the function ratherthan the entity of the system itself.

Although aspects of one implementation of the present invention aredepicted as being stored in memory, one skilled in the art willappreciate that all or part of systems and methods consistent with thepresent invention may be stored on or read from other computer-readablemedia, such as secondary storage devices, like hard disks, floppy disks,and CD-ROM, a carrier wave received from a network such as the Internet,or other forms of ROM or RAM either currently known or later developed.Further although specific components of the system have been described,one skilled in the art will appreciate that a system suitable for usewith the methods and systems consistent with the present invention maycontain additional or different components.

It is noted that the above-described features and processing operationsmay be realized by dedicated hardware or may be realized as programsincluding code instructions executed on data processing units. It isfurther possible that parts of the above sequence of operations arecarried out in hardware, whereas other of the above processingoperations are carried out using software.

Further, methods and systems consistent with the present invention arecarried out by providing a user selection means, including selectionbuttons, in a menu, dialog box, or a roll-down window of an interfaceprovided at the client, and the user may input commands through akeyboard or the like. The selection means may be constituted by adedicated piece of hardware or its functions may be executed by codeinstructions executed on the client processor, involving a display unitfor displaying a selection window and a keyboard for entering aselection, for example.

Program Modules

One embodiment of the program (at least either 15 or 28 or both) of thepresent invention includes four major program modules: Vector-flowTopography (VfT), Code-Division Multiple Transaction (CDMX), SpreadVector Resolution (SVR), and Matrix Quartermaster (MaQs). Each programmodule is independently capable of supporting various new financialservices, and can be used individually in other applications; butconnected together, working in tandem and with other program modulesfurther described below, they create the distributed capital systemplatform consistent with the present invention.

However, one of ordinary skill in the art would know that there may beadditional modules or programs that could be used to achieve thefeatures of the present invention, or that the program modules could becombined into a single program for the same purpose. Further, thefeatures and processing operations of the five major program modules maybe realized by dedicated hardware, or may be realized as programsincluding code instructions executed on data processing units. It isfurther possible that parts of the above sequence of operations arecarried out in hardware, whereas other of the above processingoperations are carried out using software.

As stated above, the following program modules consistent with thepresent invention, may be run by the parent program of the distributedcapital system architecture, and can be part of a client-serverenvironment, or part of a distributed platform of client computers.

1) Vector-Flow Topography Program Module

The Vector-flow Topography (VfT) program module runs the user interfaceand enables the streamlined construction, testing, and management oftransactions of all types. The VfT module allows a user to rapidlyconstruct financial transactions with visual objects arranged andconnected on an on-screen Transaction Workpad, and then test theproposed flow of instruments and funds, payments, debits, accountbalances, etc. prior to execution. The VfT program module also receivesand displays various data, confirmation, and other indications to theuser following a transaction or at any other time after initial enteringof transaction specifics into the system.

Thus, users can construct and save transaction events, and reuse them asoften as desired. The VfT program module will allow the user to easilyaccess the history of all executions and testings of the constructedtransactions, which information is to be tracked by the CDMX programmodule, (see below). In this way, the user may review any and alldetails of any of his/her transaction events at any time.

While capable of assembling and executing simple transactions likebill-payment, etc., the VfT program module also handles sophisticated,complex, or so-called “compound” transactions, where “compound” isdefined as constituting multiple, or compounded, interim steps ortransactions to achieve the desired commercial result of position. TheVfT program module's “drag and drop” capability allows compoundtransactions to be easily assembled, tested and executed.

2) Code-Division Multiple Transaction (CDMX) Program Module

The CDMX program module runs the tracking and accounting which makes thedistributed capital system of the present invention possible. The CDMXprogram module handles two types of data simultaneously (financial andcommunications) securely and privately, preserving and using therelationship between the two dimensions, but nonetheless retainingcomplete separation, confidentiality, and anonymity of thetransmissions. The CDMX program module thus employs both acommunications protocol and a transaction protocol, and monitors andmatches precise data requirements, allowing random-party connections tobe achieved (which is handled by the algorithms in the SVR programmodule, see below) completely random parties according to a macro senseof counterparty matching. The CDMX program interfaces with themultiple-mean matching engine (the SVR module—see below) to complete therandom-party matching, attaching appropriately devised tracking codes tothe amounts in the DCS of the present invention. Even when the financialvectors are broken up into different, smaller components, or whetherthey are recombined later, the CDMX program module keeps track of allthe components as they go through the system within a zero-sumaccounting environment.

The CDMX program module will track four types or categories ofuser-programmed transactions: Real Time, Passive, Fixed, andInstallment. Real-time means instantaneous processing, whether atexecution of the transaction request or when set times have expired;Passive means that the user does not determine the timing or amount ofthe processing, and the system executes the request at random and/oroptimal times before the user indicated time limit expires; Fixed meansthe user has indicated a set of requirements for execution, and that thetransaction will not occur unless triggered by the requirements beingmet; and Installment consists of combinations of the other three types(can be the same transaction taking place at predetermined times, forexample), and when entered into the system are disaggregated into thesmaller component transactions, each tagged with a special parent codelinking all installments to the overall parent transaction.

The protocols for CDMX module were designed so that the program canunwind and trace backward to the originating account, any transaction,regardless of whether it is a Traditional Simple event, or aCollaborative Compound event (described in more detail below), withevery transaction detail preserved and recorded by the CDMX moduleledgers in the appropriate databases. Even in a distributed environment,where Distributed Funds Transfer (DFT) transactions are abundant andintended target accounts are not immediately visible, the CDMX programmodule allows the CDMX ledgers of the program, or even a very smallsubset of distributed clients/servers/servents, to reconstruct thedispersion post facto, achieving a rewinding review of the fundstransfer networks, to determine the details (i.e., what, how, how much,who, etc.) of any Distributed Capital System transaction.

The information that the CDMX program module records, will be preservedin encrypted form even at distributed clients/servers/servents,unavailable to anyone except by a deliberate act by the system monitors,such as due to official legal action like a subpoena, etc. The CDMXprogram module may also contain a built-in function that resides on thedistributed devices, that automatically sends archived CDMX data forreconciliation, to a centralized collection/monitoring server, etc.

The CDMX program module of the present invention executes the followingfunctions: a) Codestamping, b) Codecycling, and c) CodematchAggregation.

Note that the Codestamping and Codematch Aggregation sub-programs haveprocedural relationships with the Matrix Quartermaster module (furtherdescribed below), and the Codecycling sub-program executes an iterativeprocess that involves repetitive exchanges with the Spread VectorResolution program module (further described below).

With respect to Codestamping, Codestamping occurs whenever any NEWactivity is initiated. All transaction event requests that enter thesystem are codestamped using the Codestamping sub-program, and theprogram assigns a unique transaction number that will be the parent codethat relates the requested transaction to the user who entered it. Thisunique transaction number is inclusive of some unique identifier of theperson or account initiating the transaction, as well as a coding uniqueto the transaction.

Note that in Collaborative transaction events (described below), theprogram may duplicate the transaction number (since there is more thanone participant in a transaction (i.e., counterparties)), but the parentcodestamps will each be unique since any transaction number will have aunique user-account identifier attached to it.

The program also executes a Codecycling function, that tags matchedpairs in a Collaborative transaction, each time the SVR program module(see below) completes (resolves) a counterparty match. If Codecycling isrequired for the type of transaction requested, the Codecycling programmodule will create several additional child-codes to track each of thecomponent amounts that are allocated and directed according to theSpread-Vector Resolution (SVR) program module, which are traceable tothe parent transaction. The recording may be preserved in encrypted formby the program.

The program also executes a Codematch Aggregation function whereby theCDMX program module aggregates all available transaction amounts for asingle user or account, in order to net the amounts or optimize activitybefore passing the data to the Matrix Quartermaster (MaQs) programmodule for execution.

Note that Codecycling is not necessary to handle either of theTraditional Simple or Traditional Compound (further described below)transaction types.

3) Spread-Vector Resolution (SVR) Module

The SVR program module takes an input of multidimensional (i.e., vector)objects, and automatically isolates each dimensional quantity,processing them independently before execution occurs. The advantage ofisolating dimensional quantities before processing, is that efficiencyin each dimension may be captured more fully, rather than just capturethe efficiency available or accessible at the intersection of multipledimensions treated together. In other words, the SVR module can get atefficiency that is otherwise locked up in the complexity of constrained(i.e., multidimensional) objects.

Thus, conventionally two payments from two unconnected users, cannot betreated together, because the single dimension of the payment amount iscomplicated by the other dimensional variables of those payments, suchas identity of Payor and Payee, which make the two payments asmultidimensional objects quite unrelated to each other. The SVR programmodule however, can isolate each dimensional value, and process themseparately. In practice, this means that it executes the inclusion ofcompletely unrelated parties together in the same netting summations. Itis a matching utility, including various algorithms, that achieveefficiency in assigning counterparty matches. The SVR program modulehandles digital representations of financial vectors (i.e., which can becombined and manipulated mathematically yielding for example condensedor combined vectors that resolve all commitments of the componentvectors), intaking them, outputting this information to a system(described below) which can account for everything accurately, and thenexecute the resolved vectors.

The SVR program module is designed specifically to operate wherecounterparties in a Collaborative Compound transaction (see below), arenot equally balanced, i.e., when there is an unequal balance of valuebetween the two sides of a transaction environment. In these asymmetricsituations, the SVR program module processes transactions without delay,resolving the asymmetry via vector-flow particulation. As is describedin greater detail below, SVR matching allows the zero-sum“market-mechanism” of large liquid markets with theoretically largenumbers of participants to be brought to limited-participant transactionenvironments. Although on a per-transaction level non-zero-sumaccounting may instantaneously be evident, the macro vector flowtreatment of the system transaction universe will adhere to zero-sumprinciples and as successive flow is processed, all prior transactionswill come into zero-sum compliance, thus there should be an exactmatching by the program, leaving no amounts resident on either side.

The CDMX program module keeps a macro ledger which is complete whenthere are no remaining values in the system to be matched in a givenperiod.

In this way, the SVR program module executes a netting function, fundstransfer algorithms, currency exchange algorithms, consolidatedaccounting algorithms, loan syndication, and ATM-sharing, etc. (furtherdescribed below).

Algorithms Used in SVR Program Module

In detail, one potential algorithm used by the SVR program module forfilling a Collaborative Compound transaction (see below for detaileddescription) is shown in FIG. 4, where there are counterpartiesrequesting exchanges of yen to dollars, and dollars to yen.

In FIG. 4, the Nearside denotes a reference used to explain the exchangeprocess of this potential algorithm. Nearside is a pre-process state.Since every exchange is composed of a currency pair, the Oppside is thereference to the requests in the target (counterparty) currency whichwill be used to execute exchange transactions. Thus, optimal efficiencyoccurs when the total number of Oppside requests required to fill anearside request is minimized. The program prioritizes exchanges on thisbasis. Note that active-seeking class amounts are preferably filled witha single Oppside amount.

Thus, upon entry into the system, the SVR program module willautomatically classify the amounts to be exchanged as active-seeking,when the amount is below an arithmetic mean, for example, orpassive-fill, if the amount is above the arithmetic mean. Note that thisarithmetic mean constantly changes as the program recalculates thearithmetic mean depending on the amounts of vectors/funds flowingthrough the system.

Note that all requests are characterized by the SVR program as real-timerequests at or near the time they are actually processed. Since therewill be a population of passive requests, which come fromuser-programmed transactions that don't have single-point fixed time(i.e., on some date) or event-triggered execution specifics (i.e., whenthe Dow Jones index reaches 10,000, for example), but rather time-periodlimit specifics (i.e. by some date), an active reclassificationrequested by the program may call upon this storehouse of passivetransactions, to convert some or all to real time, processing them tobring liquidity to the system, and attempt to create a seamlessprogression of moderated volatility (i.e., consistent liquidity).

Further, in some cases, the program may have multiple means and providea volume-average separator to distinguish between the two means (seeFIG. 5). For example, when the volume of the transactions increasesenough to activate a preset trigger, the program will accommodate thisincreased vector flow by creating a new parallel channel to process thevolume. The trigger bifurcates the volume into sections, each one actinglike the previous single-divider program function (see FIG. 4). When thelarger vectors in the upper half as shown are resolved and the matchesoccur, remainders will drop into the lower half, and as the volumedecreases, a preset trigger is tripped and the program will remove theseparator, returning the program function to its original single-dividerstate.

Active-seeking amounts will target passive-fill amounts in therespective target currency. No two potentially matchable requests canactively seek each other. If an amount is originally classified by theprogram as active-seeking, the program will seek to fulfill the requestwith a single counterparty match amount (see FIG. 4). If an amount isoriginally classified by the program as passive-seeking, then it will bereduced by active-seeking amounts until it falls below the mean and isreclassified to become an active-seeking amount itself, after which itis filled and the transaction is completed.

Thus, the matching of a request to exchange currency can be matchedusing several algorithms—with the active-seeking transaction on theOppside being matched from a passive-fill transaction on the Nearside,or vice-versa, or by a staggered linear match, or an angled Nearside allseek opposite-side match (see FIG. 7A).

In normal activity of markets and trade, sometimes there occurs adisparity in the vector flow. Just as there are instances everyday wheresellers are offering something at some price E but the abundance ofbuyers are only willing to pay a much lower price D, the lack ofliquidity visible to the system from direct participants may berepresented as a pair of triangles, with one side much larger than theother, indicating a large volume of vectors available (i.e., “sellers”)with too few counterparties (i.e., “buyers”) on the other side.

This imbalance may be in reference to trans-currency events, or domesticevents that are structured as directional counterparty matching, or anynumber of other situations where one side of a transaction type is moreabundant than the other. The SVR program module will take an inflow ofself-selected vectors, the self-selection guaranteeing that all vectorshave at least one variable which is the same. For example, in domesticDistributed Funds Transfers, the currency is the same for all vectors,and it is the direction variable that is match-paired. In currencyexchanges, direction is not important and so the match-pair basis is thecurrency-pair.

In the event of this kind of disparity, the system will process as muchas it can, which means until all available vectors on one side have beenprocessed, leaving the imbalance in an empirical state with zeroavailable vectors on the opposite side (see FIGS. 6 and 7A).

When this happens, it could be due to a macro-world liquidity crunch, ormore likely, it could be due to a small user-population (at least whenthe system is still being introduced and there simply aren't enoughpeople signed up to ensure that liquidity won't be an issue). In thisevent, the program of the system could be preset to direct the remainingone-sided vector-flow toward more traditional channels where liquiditycan be provided by an interbroker for example, and the owners of thosevectors can get their transactions fulfilled (i.e., a capital infusionfrom traditional channels—see FIG. 7A). In this way, the user may notrecognize the switch of liquidity pools, from system participants tothird-party big-bank interbroker/trader.

Accounting Netting

In the context of corporate enterprises, for example, which entitieshave transactions and financial relationships with many counterparties,when an enterprise has a multitude of transactions during a set periodof time, there will likely be liabilities (negative) and receivables(positive), and often there will be positive and negative transactionswith a same counterparty. Rather than net the same-party transactions toget a single result for that one relationship, the SVR program willdefer the specific netting process, and instead, sums all parties'period-negative and period-positive values (across all parties that theenterprise has to deal with). Thus, direct same-party netting ispreferably bypassed in favor of setting the stage for macrospread-netting amongst all parties in the transaction universe.

Transaction Spread-Vector Netting (SVN)

Spread-Vector Netting or Distributed Direct Exchange, is a multi-partycompaction, and is possible when any party, anywhere, is transacting.The SVR program module when executing the SVN function, can handle anyand all transaction sizes, individual or institutional. A much largernumber of participants is possible than with conventional netting.

In SVN, multiple parties are always populating the spread net, andcross-liabilities and linked settlement are not necessary. Conventionalnetting demands both a fixed number of participating parties, as well asa fixed time period over which to net. Spread-netting requires neitherof these. Complexity is not likely correlated to the number of parties,and risk is likely to be inversely correlated to the number of parties.

To spread-net out a liability circle (which is defined as a number ofdebtors in a circular arrangement such that remittance of payment tofulfill the debt obligation may halt as each debtor in the circle waitsto be paid) in SVN, the program nets as is described under CPN, butinstead of maintaining the vector relationships as is, the programredirects any vectors necessary such that the net result in/out for eachParty is the same absolute value that it was prior to netting (see FIGS.8A and 8B). In tracing the transactional directions of Party D owesParty A, and Party C owes Party D, after spread-netting, the programallows Party D to compensate Party C and Party B—a complete opposite ofthe transactional direction for the former, and a completely newrelation for the latter. Spread-netting appears to deliver more than a50% improvement in risk-reduction over conventional netting. Thus, thetotal transacted is 34, with the netted physical settlement being 8, andthe reduction in amount at risk being 26/34=76%.

4) Matrix Quartermaster (MaQs) (aka the Distributed Banking LendingCredit (DBLC)) Program Module

The Matrix Quartermaster (MaQs) program module is the negotiatingmanager that takes conclusive aggregate transaction information as aninput, converts that information to execution instructions, and theninitiates the execution of the transactions over whatever infrastructureis required, and uses whatever protocols that already exist, and dealswith multiple accounts and systems to ensure that all parties'transactions are achieved. The MaQs program module works with the CDMXprogram module or similar tracking-modules, to activate the execution ofcapital movement.

The MaQs program module carries out the instructions over existinginfrastructure. The MaQs program module holds or incorporates variousAPI's that allow it to interact with the rest of the financial andbanking world. This includes a vast range of entities, including, forexample, the Automated Clearing House (ACH), the Federal Reserve Fedwiresystem, ECN's such as Archipelago, Instinet, and Island, Credit Cardcompanies, banks, utilities companies' accounts, Web Merchants, etc.

The MaQs program module packages the execute commands assembled by theVft program module and the user-account information provided by the CMDXprogram module, into proper and formal execution instructions accordingto the infrastructure being used to carry out the transaction. Sincemultiple infrastructure networks may be used, the MaQs program module isable to package transaction commands into a variety of formattedexecution instructions.

Thus, the MaQs program module executes the transactions that arecreated, programmed, resolved, or otherwise in the distributed financialsystem of the present invention. The MaQs program module is the link tothe greater network of markets, product and service providers, and ofcourse, customer accounts at banks and all other relevant entities (suchas utility companies, insurance companies, etc.). In the event that thesystem has its own accounts involved in operations (as may be necessaryto implement certain functions or services, such as ATM Sharing or theInvestment Engine, see below), the MaQs program module will take capitalvectors out of the system and supply capital vectors into the system.

The program includes bridges between the present system and othersystems in the market (i.e., stock market funds, New York Stock Exchangeetc.), such that the program will be able to pass data retrieved fromaccounts and markets through to the system for display and manipulation.No new secure-system infrastructure is required.

Bank Multiplexer API

The following describes an example of one kind of API that may becomponent to the MaQs program module. Instructions or market data-feedwhich enter the system and instructions which are executed and handledfor distribution to the user bank accounts, are handled by the BankMultiplexer program. “Multiplexer” is used here to indicate that thesame API may in practice be used duplicatively to simultaneously connectto more than one account or institution. Note that the program of thepresent system does not handle transactions exclusively in serial order,but rather, will execute multiple transactions at the same time.

The Bank Multiplexer program for example, reads the identifier codes oneach processed transaction amount, and translates these into variousfinancial network instructions, for example direct-deposit anddirect-debit instructions to be sent to the bank accounts registeredwith the system. It is possible that when passive requests enter thesystem, an additional code will direct the program to draw down theseprogrammed transaction amounts at different times, and deposit them intoa system-owned account, for use in the investment engine until needed toexecute the programmed transaction (see further below). The program,which runs the investment engine, will employ the aggregated funds asneeded, at the end of which it will remit the original exchange-matchedamounts to the appropriate end-user counterparty accounts, retaining theprofits in the system account for further use.

5) Code Division Multiple Transaction (CDMT) Program Module

Code-Division Multiple Access is a telecommunications technologyspecifically designed to maintain the interlinked connection (i.e., avoice/data transmission) between single source-sink pairs interlacedwith lots of others, for the specific purpose of increasing bandwidthover the same communications infrastructure. Code-Division MultipleTransaction (CDMT), working in conjunction with Spread VectorResolution, does not concern telecommunications bandwidth provision, butrather the matching of fungible-trade counterparties, and furthermore,is distinguished by the fact that it does not fix the counterparties oneach end of transactions for the entire duration of a transaction(unlike CDMA which can only take a set input, delivered to a set outputfor the entire duration of a connected session, e.g., a phone call,cannot and does not randomly switch between unknown parties during themiddle of a call). In fact the two technologies CDMX and SVR workingtogether can link, switch links, and add new links on either counterparyside to a multiplicity of random counterparties, who are otherwiseunrelated and may remain anonymous if desired.

However, the Code-Division Multiple Transaction (CDMT) program module ofthe present invention, working in conjunction with SVR program module,does not concern telecommunications bandwidth provision, but ratherexecutes the matching of fungible-trade counterparties, and furthermore,is distinguished by the fact that it does not fix the counterparties oneach end of transactions for the entire duration of a transaction (seeFIG. 10).

In fact, the program utilizing the CDMX and SVR program modules, workingtogether, can link, switch links, and add new links on eithercounterpary side, to a multiplicity of random counterparties, who areotherwise unrelated and may remain anonymous if desired.

Because financial transactions are conducted in a zero-sum framework,every counterparty pair must consist of a balance of value or thetransaction cannot be considered valid, and in practice, won't occur.The program via the CDMX program module, makes it possible for example,for anonymous buyers and sellers to be automatically matched simplybased upon price (i.e., when there are a multitude of buyers and sellersat the same price, the system will automatically code-divide theincoming trade-requests such that the zero-sum can be spread to anon-symmetric number of counterparties) (see FIG. 10). Hence, fivesellers of US dollars (who are also buyers of Japanese yen), are servedby just three counterparties (see FIGS. 9-10). There is no need for anyof the counterparties to know or be aware of one another.

Sign-Up

First, a participant must sign up as a system member. In general, tosign up and create an account with the system of the present invention,the participant would simply have to have an e-mail account in order togo through a standard opt-in procedure, initiating the username andpassword at the website, for example, and having that website take basicuser information in order to create an account file, then sending theopt-in verification request to the supplied e-mail address.

Upon verification the user account would become active and the usercould either download a distributed client application, and then goabout inputting various account and financial data to give the newdistributed capital account access clearance to any 3^(rd) partyaccounts the user wanted to be able to manipulate from within thedistributed capital account, or, the user could feed the same kind ofinformation to a centralized server for the same purpose.

However, the user may not be provided with complete access to the systemat sign-up, but rather, may have to proceed through staging, withminimal functionality available to the user upon initial signup (such asthe ability to execute traditional simple transactions, and limitedtraditional compound transactions), but additional more powerful tools(i.e., collaborative transactions) becoming available throughdemonstration of awareness of, familiarity with, and or adherence to,financial regulations, risk profiles, investment structures, tax rules,etc., perhaps via online seminars and tests, according to the number andvalue of transactions executed, and proof of sophisticated investorstatus, etc.

For Enterprise applications, the present system would support multipleaccess passwords and user-clearance levels, such that for example a CFOwould have Master privileges and full functionality over the Corporatesystem account, and therefore the greatest freedom to manipulate andmanage assets of the corporation, while the lower-level financepersonnel may have access to the same accounts for visibility reasons,but without the Master privileges to manipulate or manage.

This approach means bringing the very advanced art of challenge-rampdesign so visible in video-games, to financial services provision. Byintegrating a challenge-ramp that incorporates educational orproblem-solving interaction, as well as typical user statistic hurdles,it is possible to create an interactive environment built aroundfinancial services.

The credit rating system explained further below, may drive aclassification system, in much the same way that in role-playing games,greater powers or strength (such as a more powerful sword, or greaterwizardry spells) accrue to users who accumulate certain artifacts ortechniques along their journey. Thus, the present system may classifyusers according to Financial Skill, Capital (or Asset) Power, etc., aswell as credit or Integrity. As the population of users increases, therecould be categorical rankings available to the population for reference;so that as the broad community matures, the reputation of users wouldtake on the significance of credit scores or Moody's™ ratings, etc.;however, with the power of the credit rating management being squarelyin the hands of the users and the community, not a secretive 3^(rd)party organization such as Equifax™, et al.

Another alternative for initial signup, is that an official agency couldverify the user, which would require an official identify and otherpersonal information such as a social security number.

System Registry

Once the user becomes a member of financial system of the presentinvention, the user will be able to register his accounts, such as bankaccounts, utilities accounts, credit card accounts etc., which he wantsto have available for inclusion in transactions he may want to build,test, and/or execute.

Various different methods of loading financial account data and accessinto the present system are possible. For example, a personal accountaggregating service uses an assistant that travels with the user to eachfinancial account website, which can capture the login and passwordinformation, to make it available to the user at the personalaggregating service account.

All existing systems to date involve accounts that are managed by theuser, and accessed by the user. In no known instance do users of thesesystems grant access and send such access privilege to other users. Thepresent invention does intentionally however enable this multipartyaccess and granting of access to transaction events.

For example, in collaborative transactions, account access or evensingle transaction access, is received by users who have been grantedsuch participation privilege, and it becomes available to the user withno specific action required of that user. Of course the user has theright to refuse the granted privilege, but gaining access privilege wassomething that occurred at the instigation of other system users. Whileit is expected that various financial service providers increasefunctionality and grant access to that functionality within the users'existing accounts, nowhere is there a financial services platform thatis designed to facilitate system users interacting with each other ascollaborating participants, granting permissions to each others accountsand transactions.

Financial Transactions Types—Four Major Embodiments

The methods and systems consistent with the present invention encompassfour major types of financial transactions: Traditional Simple,Traditional Compound, Collaborative Simple, and Collaborative Compound,which will be described generally below, before being further describedin more detail.

Traditional Transactions

Traditional Simple

Presently, financial services are predominantly pursued in the contextof one-to-one relationships between the financial service provider andthe customer or client. One-to-one commercial relationships, and thetransaction events that occur in their context, are fairlystraightforward: There is usually one seller/provider, one buyer/user,and one form of purchase currency or credit, all arranged in a simple,linear equation such as: buyer purchases goods from seller, or, userpays credit-card company.

These financial interactions and the services that support them are whatthe system of the present invention designates as Traditional Simpletransaction events. Examples of Traditional Simple transactions (seeFIG. 22A) would be the purchase of stocks from a broker, or logging ontoa website and making a purchase, or paying a credit card bill, etc. Theessential relationship between a Customer and Provider has not changedeven though the on-line aspect of the transaction has made ittheoretically easier and faster. In fact, single users connecting tofinancial services, one company at a time, fail to use the realnetwork-advantage of a global computerized network such as the Internet.

Although the present invention is designed to support networkcollaborative transaction services that leverage the realnetwork-advantage of multiple connected systems, users, providers,customers, buyers, sellers, etc., Traditional Simple transactions can beeasily performed using this distributed financial system, since the userusing the present invention is provided the omniscient perspective ofbeing able to see and manipulate the involvement of all accounts inhis/her transaction universe, whereas current methods and systems placethe user at the node perspective of just one of the participants of thetransactions, such as at a credit-card website, or a bank website, etc.

Traditional Compound

In a Traditional Compound transaction (see FIG. 22B), a user can manage,integrate, and program several Traditional Simple transactions at thesame time. For example, the user can manage and integrate the user'sCredit Card bills along with the user's Home Loan, Utility bills,Stocks, Bonds, online purchases, and anything else that involves atransaction the user wishes to make. A Traditional Compound transactioncould include obtaining a new home-equity loan, and using the loan topay credit card bills and an auto-loan, or a child's college tuition.Currently, there is only one way to take care of these kinds ofdecisions: they must be executed one at a time, and the user must gatherdata from various sources, then have the background and skill tounderstand how to compute and then achieve the various optimal financialsituations via an ordered combination of a multitude of one-to-oneindividual transactions, which complexity is discouraging to mostconsumers. To clarify, in this situation where the user of variousfinancial services wishes to avail him- or herself of a multitude ofavailable services (or check to see if s/he should) in a combined orintegrated fashion, such as consolidating a bunch of debts held byvarious 3^(rd) parties, there is no existing automated support servicethat can facilitate a user in assembling a clear and straightforwardfinancial execution strategy for his or her own specific situation.Because users of financial services have no way of getting support forthe Traditional Compound transactions that they need to execute in orderto manage their many commitments and responsibilities, users are left totry and artificially assemble compound transactions by arranging andtiming a series of coordinated Traditional Simple transactions. Someexisting services can aggregate multiple accounts' information in oneplace and interface, but no existing system lets the user manage,integrate, and program the interaction of multiple accounts. The presentinvention however, enables this.

For business users, the user can assess the interplay between thevarious financial activities and responsibilities of the company, andcan for example, make salary payments, vendor payments, refinance,obtain loans, etc., automating where prudent, and capturingunprecedented data (which amounts to visibility of the corporation'sfinancial status) that enables better decision-making. Thus, vendorbilling can be performed next to treasury management (i.e., currencymanagement, credit hedging), or revenue streams etc., all within thesame interface. Traditional Compound transactions allow users to buildthe interplay between their various financial arrangements, receivablesand liabilities (cash-flow management, etc.) and obligations, andschedule as well as test transactions to assess the results as theyimpact the whole, not just a single account or relationship.

For example, larger enterprises tend to have separate groups, each thatauthorize, receive, and pay for corporate purchases. This separationmakes for delays in processing the approval both in purchasing as wellas payment as the disparate groups must rely on repeated communicationin order to assemble the aggregate information necessary to reachapproval. Traditional Compound transactions can be assembled tostreamline this invoicing process with each division or group logging inor using e-mail to advance or trigger the progression through theprocess toward a final approval and remittance order issued and managedby the corporate financial department. In the same way that simplesystems now allow alerts to be set for some variables, resulting with ane-mail or other notice sent to the user, the senior party responsiblefor, in this case, an invoice, can orchestrate various triggers alongthe process of invoice handling, and allow disparate users in variousdivisions (for example, the corporate mailroom), to approve of receiptof goods and quality of goods (i.e., correct invoiced part numbers andfitness of goods according to shipping roster), while another group ordivision (the specific team using the goods) approves of the accuracy(i.e., the correct part as required for the project), etc., before theaccounting department is released to remit payment. This control can beimplemented throughout the corporate structure, allowing the enterpriseto have much greater and faster data on the financial state of thecompany.

In addition, the user can set the parameters of the integratedtransactions (i.e., stocks to be sold when they reach a certain value,or stocks to be sold at a certain time or day etc.). Thus, thetransactions can be automatically and remotely set, and the usernotified when the transaction takes place, as well as have access tosummary information detailing the component transaction results, as wellas the overall compound transaction results.

Collaborative Transactions

One embodiment of the present invention may be loosely defined as theexistence of networked or collaborative options in the realm offinancial activity. This is uniquely different from existing financial,banking, and commerce activities. The existing paradigm for theseactivities (generally inclusive of Commerce) is almost exclusively astructure that orients relationships in a singular, linearCustomer-Provider arrangement. However, collaborative activities aremutually oriented and inclusive of more than a single relationship;where all parties can be simultaneously Customers AND Providers.

Collaborative transactions, which are designed to be supported bymethods and systems consistent with the present invention, include amultitude of parties and a diversity of forms of currency and/or credit.Collaborative transactions include transitive (or spread-vector)actions, which means that the transaction equations can be complex asthe net-zeroing of credits and debits, receivables and liabilities,etc., are treated on a global level amongst all participants in thenetwork universe, rather than only between directly related parties asin Traditional transactions.

This means that because the distributed capital system of the presentinvention has a greater awareness of the transaction universe than anysingle participant, it can actively and intelligently optimize thelogistics of transaction, for example, theoretically computing thetransitive shuffle of liability across thousands of participants suchthat the total volume of actual funds movement in the universe maydecrease for the same volume of paid liabilities in the universe, asreceiver and obligor parties can be matched according to the accountsand institutions being used to remit or accept payments—thus, forexample, allowing funds movement to be handled as an internal bankingexecution (where obligor and receiver can be identified and at leastpartially matched at the same institution, even though these individualparticipants may have no connection at all to each other), with no netfunds, or reduced net funds exiting that bank and going out intointerbank transfer networks such as ACH or CHIPS, etc.

An approachable way to try and visualize Collaborative Transactions,would be to examine a specific reality of stock markets. Buyers andSellers rarely know each other, but because the instruments being tradedare fungible, one party's sold instruments can become any party's boughtinstruments regardless of proximity or awareness. The participants whoseinstruments change hands from Party A to Party B do not care and do notneed to care who the counterparties are; they only need be concernedthat their transaction net-zeros locally—the market mechanism itselftakes care of the net-zeroing on the global level across alltransactions and between all participants. The present invention bringsthis guaranteed global-zeroing mechanism to a variety of transactionsituations which would never have the critical mass or structure (i.e.,securitization, etc.) to function (i.e., achieve liquidity, etc.) asmarkets.

Currently, global-level zeroing is evident only in liquid markets activewith a theoretically large number of participants, that tradesecuritized or commoditized items. The present invention brings thisglobal level zeroing mechanism to limited-participant transactionenvironments. Using transitive actions achieved with the program calledSVR program module, as described above, any number of transactionsinvolving as few as two participating entities can now have access to asystem that will net-zero responsibilities across all participatingentities. Realize of course that a two entity transaction, or multipletransactions between two entities, can very easily be netted, so asophisticated network technology may not be needed to resolve thezeroing amongst the parties; but the present invention could nonethelessmanage this two-entity transaction environment. When there are three ormore parties, however, it is not intuitively easy to resolve the globalnet-zero, and this is where the present invention becomes most usefuland most valuable, bringing efficiencies in terms of total capital atrisk, total economic capital deployed, alacrity of transaction, etc.

In participating in this open market, all participants aresimultaneously both Customers AND Providers. In this case, where allparticipants demonstrate Customer AND Provider characteristics, thetransaction type would qualify as Collaborative Compound, the mostsophisticated and expansive transaction type (i.e., a stock market isonly one example of a Collaborative Compound transaction).

Fungibility facilitates transitive resolution. What this means is that,for example, if party A owes party B some amount X, and party B owesparty C some amount X, all three parties' transactions roles andresponsibilities can be satisfied with a single payment X that party Aremits to party C. A distributed capital system will find and executethis transitive scenario regardless of whether Party A, B, and C knoweach other, or even are aware of each other—to the same effect thatbuyers and sellers of public equities do not know and do not care whothe counterparties are to their transactions. It is not important who isthe current Purchaser or Seller in collaborative transactions, butrather, the issue is making sure that the liabilities and receivablesare all fulfilled, and the correct parties get credited for havingfulfilled the liabilities they were specifically responsible for, whilethe correct receiving parties actually get what they are owed.

Since it is unlikely in the universe of transactions that randomparticipants will arrive at liabilities of the exact same amount X aspresupposed in the example above, the distributed capital system has amethod and system for dealing with amounts that do not match (i.e., thatare asymmetric). As stated above, the Spread-Vector Resolution programmodule, in treating the transaction universe as a flow-based model,achieves “resolution” of non-matching amounts, by stringing togetherfollow-on counterparty matches of those parties' partial or fullliability or receivable amounts, in never-ending fashion.

Collaborative Simple

In a Collaborative Simple transaction (see FIG. 22C), two or moreparties independently elect to participate in the same opportunity. In asimple example, this would include a small entrepreneur making aprivate-investment opportunity available to a select group of investors.Currently a scenario such as this one would be pursued as a collectionof one-to-one relationships, with the entrepreneur being party to eachone independent of others (despite the pooled-asset aggregation ofinvested funds in the corporation).

Mutual Funds are a good example of how a distributed capital system mayimprove customer-service provision to investors; however, currentlymutual funds follow both the traditional one-to-one relationshipparadigm, and the static treatment of transactions. A distributedcapital system however, would allow a great deal more service and valueto be returned to the customer, by providing, for example, constantvisibility on the state of the fund, and perhaps even other investorsreal-time actions relevant thereto.

For example, two friends lending a third money—where all lending partiesare “customers” of the “investment opportunity” provided the thirdfriend who offers to pay them back with interest. Another example, is aChurch which raises money from its congregation in donations, money froma bank(s) in the form of loans, whereby the loans, the donations, thepayments with interest, etc. could be managed by the distributed financesystem of the present invention, and at a cheaper cost than if theChurch did all the transactions between each member of the congregation,as well as a number of banks.

Employee-owned corporations and public corporations that want to allow agreater number of investors to participate, for example, in seniorinstruments (debt) such as syndication of credit lines, etc., would beusers of Collaborative Simple transactions.

Collaborative Compound

Another embodiment consistent with the methods and system of the presentinvention, is the Collaborative Compound transaction (see FIG. 22D). Inthe Collaborative Compound transaction, both sides of the transactionare considering themselves to be customers (and in a context where doingso makes them both providers as well). The customers may not have anydirect awareness of each other, and the distributed capital system ofthe present invention is simply using the Collaborative Compoundembodiment to make the transaction more efficient or less costly orboth, etc.

In an example of a Collaborative Compound Transaction, a user's companymay require British Pounds for certain activities. In a traditionalmanner, the user would go to a bank either physically or online, etc.,to arrange for a certain amount of capital to be converted from US$ toGB£.

When a second user, unrelated to the first, somewhere in the world,requires U.S. dollars for certain company activities, traditionally, theuser would in similar fashion, go to a bank or other financialinstitution etc. physically, or online, etc., and arrange for a certainamount of capital to be converted from GB£ to US$.

Both users are customers, and the financial institutions can providethem both with services in the traditional manner. However, both userscould arrange to transact with each other, or automatically andanonymously be matched with each other, to mutually serve each other'sneeds in the distributed capital system of the present invention, sobecoming providers at the same time as being customers.

In particular, the users could utilize the distributed capital system ofthe present invention to request an exchange of currency. The program ofthe distributed capital system of the present invention uses avector-flow algorithm to resolve the problem of exact matching of thefunds requested by both users/parties, allowing the parties to transactto the full amount possible, and then taking any remainder amount (iffor example, one user required more US$ than the other party couldprovide), and having a different “customer” fulfill that partial amount,leaving that customer's remainder filled by another, successive customeron the opposite side of that transaction.

This is a flow-based treatment of transaction, rather than thepredominant static treatment which forces an assumption that alltransactions must be met in full by a single counterparty (such as, inthe example where the Bank fulfills the exact amount of desired currencyconversion). This type of Collaborative Compound transaction can takeplace regardless of the amounts involved—whether small or massive—thus,perhaps contributing to a moderation of volatility across regional andnational economies around the globe since liquidity would theoreticallyincrease as fees drop due to the removal of 3^(rd) party intermediaries,resulting in less friction (and hence less latency, that causes economicstraint, and hardship) between economic (currency, policy, sovereigntyetc.) domains.

Timing of Transactions

Note that in discussing these four embodiments of types of transactions,the user can indicate whether they wish instantaneous processing(typically desired for a bill payment, or investment-grade request), orthey wish to set a time for the transaction to take place (i.e., a laterdate, for installment bill payment etc.), or an event-triggeredtransaction to take place (such as a certain stock-price, or even randomvariables for which data users may wish to use, for example the ambientair temperature in Las Vegas, or the score of the Green Bay Packersgame, etc.). The first transaction is designated by the system as areal-time or immediate type of request, the next as a passive request,and the final as a fixed request. In the latter system, the funds in thetransaction may be available to the investment engine of the presentsystem (see Investment Engine below).

Traditional Simple Transaction

One embodiment consistent with the methods and systems of the presentinvention is the Traditional Simple financial transaction, which willnow be described in more detail. Although only the Traditional Simpletransaction will be described herebelow, it should be noted that all thefollowing different types of transactions may utilize the user interfaceof the present system. Thus, the user interface as described withrespect to the Traditional Simple transaction, will not be describedagain in detail with respect to the other transactions.

As stated above, a Traditional Simple transaction is familiar to mostonline users, and involves only the customer and a provider, and asimple financial transaction such as the payment of a bill.

Accordingly, once the user has logged into the system, and has beenthrough the log-in process in step S100 (see FIG. 11A) and theauthentication process in step S101, the program opens a blank displayscreen in step S102, similar to the screen which opens when a wordprocessing program is opened, with Transaction Options shown on thedisplay screen.

The user then uses his mouse to place the cursor on “File” and leftclicks the mouse, at which point, in step S103, the program provides apull-down menu listing the possible transactions available to the user,or perhaps a dialog window, options palette, or toolbar or any similarpresentation of custom designed Transactions the user has set up inhis/her account, (i.e., Existing Transaction 1, Existing Transaction 2,Build New Transaction, etc.).

Note that although activities will be described as being performed withthe action of a mouse using a cursor on the appropriate selections, andright-clicking or left-clicking to initiate an activity, one of ordinaryskill in the art will realize that these actions can be performed bycommand functions on the keyboard or by voice actuation or other similarmethods, and that the consistent advancement of “ordinary skill” in therealm of interface design will continually realize better ways topresent the same and increasing amounts of information.

Further, although various operations and transactions will be describedusing discrete steps and with a specific terminology, one of ordinaryskill in the art would know that the transactions could be achieved invarying ways and using different terminology or steps, and usingvariations of the methods described below.

Assuming this is a new or first transaction, once at the “File” menu,the user can choose “New Transaction” if the transaction is determinedas a new one in step S104, by left-clicking on that option, whereby instep S105, the program will open a blank Transaction Workpad on thedisplay screen (see FIG. 12).

Once the user is at the basic blank Transaction Workpad display, theuser can move his cursor to the heading “View”, left-click on thatoption, wherein the program will provide a pull-down menu in step S106which includes “Toolbars”.

The user then can left-click on “Toolbars” or follow to the right of“Toolbars” causing a sub-menu to drop-down, whereby in step S107, theprogram will provide a list of transaction options from which the usercan choose.

Under “Toolbars”, for example, can be a list of options including “MyBanks”, “My Credit Cards”, “My Communications”, “My Utilities”, “MyInsurance”, “My Loans” etc., as well as a selection entitled“Transaction Objects” (see FIG. 13).

One of ordinary skill in the art will recognize that design factors maydictate that “Toolbars” be replaced with a more appropriate name, suchas “Transaction Entities”, or some other such designation whichcommunicates most effectively with users.

In this example of a Traditional Simple transaction, the user may wishto pay a gas bill, which is a simple transaction involving two parties(three entities)—the user and the gas company being the parties (theuser, the gas company, and the transaction action between them being thethree entities).

Thus, the user may choose “Transaction Objects”, and left-click on thatoption, whereby the program, in step S107 will receive the command anddisplay a working area adjacent to the Transaction Workpad (see FIG.14), labeled “Transaction Objects”, and in which are disposed a numberof icons representing various financial transaction actions.

For example, the icons may represent financial transaction-actions suchas, Capital Asset Vector (payment, or more accurately, a generalmovement of capital=“Move Funds”), Convert Currency, Buy, Sell, Lend,Borrow, and Currency Hedge, etc. While resident in this TransactionObject toolbar or palette, the objects will be inert. When any of themare dragged onto the Transaction Workpad, they become active objects,the building block entities of a transaction that the user willassemble.

Once active (i.e., once on the Transaction Pad), either via mouseover,mouse button click (right or left), or some other interface-designdictated user-friendly access, the user may see “Properties” informationrelevant to that entity. Note “objects” is a subset of “entities”. Thus“transaction object” is a term specific to transaction actions, whereas“entity” is used to identify both the parties to a transaction as wellas the actions between them.

In the case of a “New Transaction”, “object entities” will not display“properties” information other than general functional-feasibility,system status type information, because the transaction is new and theaction within this specific transaction has not been used yet, and doesnot have a history of use that would create a record to display. Theactive “party entities” placed on the “Transaction Workpad” for the sakeof assembling a “New Transaction”, however, will reveal an abundance of“properties” information precisely because these “entities” are involvedin a variety of transactions beyond the current New Transaction that isbeing assembled. The user may configure the presentation of thisproperties information according to what is most important to each user.

Within the “Transaction Objects” toolbar, there will be a “Search forNew Objects” button, which will allow the user to periodically query thesystem for recent additions to the “Transaction Objects” toolbar, and soadd further functionality to user-created and user-managed transactions.However, the program will provide new “Transaction Objects” which willautomatically appear in the “Transaction Objects” toolbar in conjunctionwith periodic updates provided by the system, or, in conjunction withpre-requisite factors having been achieved (such as attending an onlineinvestor education seminar or training program, or a set period orquantified or qualified usage of the product and service). Some of thesenew “Transaction Objects” may require approval or special access (suchas sophisticated-investor status, etc.) in order to receive from thesystem.

Next, the user may choose “My Banks” from the “Toolbars” menu, wherebythe program will receive the command and display another labeled sectionadjacent the Transaction Workpad, which shows icons which refer todifferent banks accounts pre-registered by the user.

Note that although in the present invention, the accounts andtransaction actions are preferably shown as icons on the display, theaccounts and transaction actions may be available in a pull-down menu,table, grid, or the like. The transactions may be assembled by themovement of the Transaction Objects icons or placeholder representations(such as text names, or the like, etc.) using a mouse, or by commandfunctions on the keyboard or the display, or by voice actuation etc.,which are specific to handling those entities. Although the followingdescription will relate to the use of icons manipulated using a mouse,one of ordinary skill in the art will be aware that use of commandfunctions on the keyboard, or display, or by voice actuation, etc., canalso be instituted to perform the commands or initiate the transactions.

Finally, the user may choose “My Utilities” from the “Toolbars” menu,whereby the program will display a labeled section adjacent the “MyBanks” and “Transaction Objects” areas, whereby a number of iconsdepicting the “Gas Company”, “Water Company”, “Electric Company” etc.,will appear in the “My Utilities” section.

In order to perform a financial transaction, the parties to thetransaction, and the transaction action chosen to act between them, mustbe placed in the Transaction Workpad area, arranged in the relationshipdesired to be executed as a transaction.

Accordingly, the user may place the cursor over the “My Bank Account”icon (may be specific to a particular bank account at a particular bank,as registered by the user), and using the mouse, may left-click thecursor, holding, moving or dragging the icon “My Bank Account” over ontothe blank Transaction Workpad section, depositing the icon there.Dragging from the original location does not remove it from the originallocation, but rather creates a copy as the cursor moves the clicked-onobject away from the original. Thus, the program in step S108, receivesthe transaction entity in the Transaction Workpad section, as the userproceeds to assemble a transaction.

When the user mouseovers or otherwise executes an action that calls for“properties” information in relation to the “My Bank Account” iconwithin the Transaction Workpad section, the program, using the VfTprogram module, in step S109, receives this action as a command toobtain real-time information on the status of the user's bank account(i.e., account number, balance in checking, savings, etc.). The VfTprogram module executes this command, telling the CDMX program modulewhich user is sending this request, and for which entity, and the CDMXprogram module accesses the secure “Account Registry” which maintainsrecords of all user-registered accounts, and collects the proper andformal identifying, as well as access-authorizing data, for theseaccounts.

Alternatively, the system can be configured to request the required userpasswords as they are needed, and not store any user passwords.Proceeding, in addition to being stored, this access is timestamped andassigned a transaction code by the CDMX program module, before handlingthis retrieved information to the MaQs program module which executes therequest to retrieve information from the real world entity external tothe system.

Accordingly, in step S109, the program queries the user's bank over theInternet and over any secure financial networks necessary to obtain theinformation. Note that this request is sent from the client to anotherclient or the server, and the client or server to whom the request issent, performs the query to the bank. (However, note that the bankqueried may also be part of the present system, such that the request iseasily handled. In one more sophisticated transaction option, the usermay choose an option—“Scan All Accounts for Updates”—whereby the programscans all the user's pre-registered accounts and provides real-time datarelated to each account to the user, advising the user of any new bills,changes in balances to mutual funds or bank accounts etc.).

In step S110, the MaQs program module receives the information from thebank at the server, at which point the program passes the retrievedinformation back to the CDMX program module, including as well, anygeneral system-status or network information that may be provided as aresult of issuing a request over that network. The program via the CDMXprogram module, then timestampes, codes and stores all the receivedinformation. The CDMX program module then filters the information itreceives in order to pass back to the VfT program module, only therequested information, and thus the real-time status of the user's bankaccount is provided to the client computer which displays it for theuser in step S111, on the screen next to the icon or available under apull-down menu, table, other window, or the like.

Note that since the user has pre-registered his bank account with thesystem, this query can be performed securely and results are retrievedalmost instantaneously, as would a user receive, for example, whenattempting to retrieve cash from an ATM machine. Further, since existingsecure networks are used, no new physical infrastructure is necessary toperform this query and receive the information.

The user now can perform the same steps with respect to the “GasCompany” icon, holding and dragging the “Gas Company” icon over to theTransaction Workpad, and by performing a mouseover or the like at the“Gas Company” icon, the program can obtain real-time and otherinformation regarding the “Gas Company” (i.e., account name and number,customer service telephone, amount due, past amounts paid, etc.).

The user can also perform the same steps to choose a Transaction Objectfrom the “Transaction Objects” section. In this case, “Capital AssetVector” would be an appropriate financial transaction action to placebetween and connect “My Bank Account” and “Gas Company”. Thus, after the“Capital Asset Vector” has been retrieved from the “Transaction Objects”section and received by the program in the Transaction Workpad section,in step S112 (see FIGS. 11B and 14), the user must now initiate and mayconfirm initiation of the financial transaction if s/he wishes it toactually execute.

Accordingly, the user may attach the “Capital Asset Vector” between thetwo entities (i.e., “My Bank Account” and “Gas Company”) in order tomake the transaction a completely assembled transaction (i.e., paymentof the gas bill from the user's bank account) which the program canreceive in step S113 (see FIG. 15).

Note that until the “Capital Asset Vector” Transaction Object isattached to both the “My Bank Account” entity and the “Gas Company”entity icons, no transactions take place, execution cannot occur, and amouseover or other “Properties” check on any of the entities on theTransaction Workpad will produce no display or evidence of results orconfirmation for this transaction. The program, in step S114, will checkthe assembly of every transaction to make sure at least the syntax ofthe assembled transaction is feasible (although it cannot check andavert all user-errors in amounts and selected entities, etc.), beforeallowing the user to initiate execution (see FIG. 16). Likewise, theprogram will require the user to set and confirm both the direction ofthe “Capital Asset Vector” (so that a payment is sent to the GasCompany, rather than a remittance request (i.e. a refund request or billpresentment from the user to the Gas Co.)), as well as the amount of thecapital vector, prior to the assembled transaction becoming availablefor execution via user-initiation.

In order to assemble a transaction, the user can then left-click on thetail of the “Capital Asset Vector” icon and hold and drag it onto the“My Bank Account” icon, where it will attach with a “snap”. In addition,the program may change the border of the “My Bank Account” icon to makeit thicken or change color, etc., to show the attachment was successful.The “snap” feature would be familiar to a user who can use a “Draw”application and attach arrows to various objects.

The user can then left-click on the head of the “Capital Asset Vector”and hold and drag it onto the “Gas Company” icon, where it will alsoattach with a “snap”, and result in the program making a thickenedborder or the like, in whatever user-centered design is chosen tocommunicates a successful connection.

Note that although the above steps are described in order of placementof the movement of funds from one entity in payment of another entity,one of ordinary skill in the art will be aware that these steps can beperformed in any order, and the entities can be placed in any order onthe Transaction Workpad, connected either immediately after eachplacement, or after all the entities are placed on the TransactionWorkpad, etc.

Once the connection is made between the three entities (i.e., “My BankAccount”, “Capital Asset Vector” and “Gas Company”), the transaction isfully assembled and becomes an active transaction, having passed thesystem's transaction-syntax feasibility check and awaiting user-settingand confirmation of transaction object Criticals.

Once fully assembled, a mouseover or other similar “properties” requestaction, available as user-centered design may dictate, of the CapitalAsset Vector by the user, will initiate the program to displayinformation detailing the characteristics of that Capital Asset Vector.This includes, for example, the Vector Source Entity (i.e., the user'sBank, including the institution name, account number from which fundswill be withdrawn, etc.); Vector Destination Entity (i.e., the user'sGas Company, including institution name, target account number, etc.);Transaction System or Network (ACH, PayPal™, e-Checking, etc.) mostlikely to be used at time of execution, Network or System status, ifexecution were to proceed at current time, etc. Also, in the case ofexisting assembled transactions which have been used in the past, (i.e.,paying last month's Gas bill would be the same transaction entities andassembly orientation as this month's bill transaction and vector, withonly the timing and amount to change), the program will provide anindication of previous transaction activity using that specific CapitalAsset Vector (i.e., payment from specific user-Bank Account, to GasCo.), and further details may be accessible as user-centered designdictates may be the optimal method of display, referenced by the programas the Transaction History.

Note that if several different remitting entities at different times areused to pay the Gas Co., there will be a multitude of assembledTransactions, each with its own uniquely defined Capital Asset Vector,each saved as a separate file which the user may open at any time to useagain (i.e., if the user has multiple bank accounts and credit cardaccounts, etc., and prefers at one instance to remit from Account 1 andat another instance from a credit card account, etc., the user willchoose to open the saved transaction file according to method ofremittance desired). Whereupon if the user wishes to see in one placethe details of all activity involving the particular Gas Co. account,s/he may simply access the Gas Co. account history in the “Properties”of any one of the “payment to Gas Co.” transaction files, as the programupdates the Gas Co. record in all of them according to activity on theGas Co. account, regardless of which remitting account sends payment.

If the user wishes to view the “Transaction History” for a specificCapital Asset Vector within one of these “payment to Gas Co.”transaction files, the user may select this option and the program willaccess a database to provide a display showing previous transactionsmade between these two specific entities (remitting entity, andreceiving entity), including, transaction amounts, dates, etc.

The assembled transaction cannot proceed to transition to “available forexecution” status until the transaction object Criticals (i.e., VectorCriticals in this Gas Co. example) are set and confirmed by the user.Upon setting and confirming the transaction object Criticals, (in thecase of a Capital Asset Vector these would be called Vector Criticals)the assembled transaction will transition to a state of availability forinitiation at the user's discretion. The program may show thistransition by changes in the display or presentation, including audio,visual, animation, or changes in state such as brightness, color, shape,dimensionality, placement, or the like.

The user may double-click, or right-click, etc., on the Capital AssetVector, whereby the program, in step S115, will open a menu on thedisplay screen, which includes various options, one option being “VectorCriticals”.

For Capital Asset Vector transaction objects, a minimum of two Criticalsmust be set and confirmed by the user. Other Criticals may be left asdefaults or unset. The two mandatory Criticals for Capital Asset Vectorsare: 1) Direction, which entails Vector Source assignment(=determination of remitting entity), and Vector Destination assignment(=determination of receiving entity), and 2) Amount, which is theuser-desired amount to be remitted. When the Capital Asset Vector issnap-attached to entities in the transaction assembly stage, the programallows these entities to become available in the Criticals interface,for selection as either Vector Source or Vector Destination selection.If the user does not choose to set the Vector Timing for thetransaction, the program will allow this setting to default to immediateexecution of the transaction upon pressing the “Execute thistransaction” button, as technical feasibility permits.

Other Criticals may include such things as currency type (i.e., amongpossible currencies accepted by the target entity), date of payment, andthe option to automatically remit multiple vectors or payments, atdifferent dates, triggered by different external events (i.e., such asconfirmation of direct-deposit of paycheck, currency-exchange target, orthe like), etc. The user may set a vector-specific password or,alternatively, set the vector to use the user's system login password,to protect access to this vector's Criticals; this setting may also becontrolled globally by the program, such that all transaction objectsrequire a password in order to view or change object Criticals.

For more sophisticated options in performing this transaction, the usermay elect for a more secure option of setting this vector or alltransaction entities such that each transaction entity to be accessedwill require the user to enter passwords at the time of execution,rather than having the program of the system maintain this privateinformation on file.

Note that the user is provided by the program with the option of settingthe timing of the transaction under Criticals. The transaction can takeplace immediately, in real-time, or if the timing of the transaction isnot specified or a later date specified, the transaction will be set topassive-fill upon execution, which means that the funds may be drawndown from the user's bank account but may be diverted to an investmentengine of the system prior to the date where it is to be filled (seeInvestment Engine below).

After setting the Criticals, the program closes the Criticals interfacein step S117 , whereupon the transaction's assembly is complete enoughto be executed. The user may wish to save the transaction at this point.The user may save the transaction at any stage, whether the transactionis completely assembled and feasible, or otherwise, just as one mightsave and close a text document at any interim stage, and come back to itat a later date for editing or completion, etc.

To save the transaction, the user should click on “File” in thedrop-down menus, and choose “Save”, or may perform this function on thekeyboard or the like, whereby the program will provide a dialog boxrequesting that the user name the Transaction to be saved. The user thenenters a Filename (i.e., Regular Gas Co. Payment), and presses “Save”,whereby the program, will save the Transaction in step S118, and ifrequested by the user in the future, will make the Transaction availablein a drop-down menu or other window of “Transactions”, under “Recent”,as may be dictated as optimal for making these files easily available tothe user. The user may create and save any number of transactions,available for re-use or review, editing, adjusting, etc., at any time.

Note that when the transaction is syntactically feasible, the “Test thisTransaction” button and the “Prepare for Execution” button mentionedbelow may change from being dimmed, greyed, dimensionally flat, or thelike, to being bright, colored, having dimensional relief and shadow, orthe like, to communicate to the user that the button function hastransitioned from an inactive or unavailable state to an active oravailable state.

At the point the user has finished assembling and confirming thetransaction such that it is feasible, the program will make available a“Test this transaction” button, placed such that the user correctlyassociates this button with the transaction concerned and not with anyother transaction or activity in the system, that allows the user tosimulate execution of the transaction prior to actually executing thereal thing.

When the user clicks on the “Test this transaction” button, the VfTprogram module, in step S119, receives this action as a command toinitiate a check on all entities in the assembled transaction via theMaQs program module, to determine viability (technical, financial, etc.)as well as to process a simulated accounting of all transaction amountsand resulting changes in all entities, for presentation to user. Notethat no capital actually moves during a test.

In this way the system can provide a predictive awareness of the user'sfinances, for the user to make and manage decisions across the range ofall user financial activities the user chooses to handle via the system.In one embodiment, the program of the system may provide customizeddecision-analysis and support to the user, based on historical andstatistical resources.

Thus, the VfT program module executes the test command, telling the CDMXprogram module which user is sending this request, and for whichentities, and the CDMX program module accesses the secure “AccountRegistry” database which maintains records of all user-registeredaccounts, and collects the proper and formal identifying as well asaccess-authorizing data for these accounts. In addition to being stored,the CDMX program module timestamps and assigns this access a transactioncode, marked with an indication that it is for Testing (simulation)purposes, before handling this retrieved information to the MaQs programmodule which executes the request to retrieve information from thereal-world entities (which are identified in the transaction via theassembled entity icons) external to the system.

Accordingly, as part of the testing step, the program queries the user'saccounts at the relevant real-world entities over the Internet and/orover any secure financial networks necessary and available, to obtainthe requested information. Note that in a client-server environment, forexample, the request is sent from the client to the server, and theserver performs the queries to the external entities.

As part of the testing step, the program directs a query to instigate abackground check to verify that the Gas Company system is up and running(capable of receiving remitted transaction amounts), determine therequired transaction currency, current transaction processing time(i.e., real-time, 18 minutes, 2 hours, 4 days, or other timer period,etc.), or the like. Further, in the same step, a similar check isperformed of the Bank to verify balance (ensure that the funds areavailable), that the Bank transaction system is up and running (capableof sending transaction amounts), etc.

The program receives the information from the various entity accounts,at which point the MaQs program module passes the retrieved informationas well as any general system-status or network information updates thatmay have come as a result of issuing a request over those networks, backto the CDMX program module. The CDMX program module then timestamps,codes, and stores all the received information, again marking the codein such a way that it can be distinguished as a Test. Then the CDMXprogram module filters the information it receives in order to pass backto the VfT program module only the requested information. Thus, thereal-time simulated execution data attendant to the user's transactionis provided to the client by the program which displays it for the userin step S120, on the screen next to the entity icons or makes itavailable under a pull-down menu or the like (see FIG. 17).

In addition to common messaging and warning dialogs, windows, alerts andthe like, the graphic properties of the entire screen interface anddisplay of a transaction under Test proceedings, and under actualExecution proceedings, may change such that they will bedistinguishable, using such differences as brightness, color,dimensionality, size, placement, and the like to readily communicate tothe user which proceeding is actually underway and being managed.

An example of how the user can test the payment function is as follows:For example, by using the “Test” function, the program willautomatically check that the funds are available at the user's Bank andalso that the Gas Company's account is available to accept thetransaction. For example, if the user's Bank Account has uncollectedfunds, or the Gas Company's account is off-line, then the transactionwill not be able to take place, and the program will notify the user ina message in a dialog box, which will pop up or otherwise appear on thedisplay stating that the transaction cannot take place. The user has theoption of retrying the transaction immediately or can program thetransaction to take place at a later time, or cancel the transactionetc.

Specifically, when using the “Test” option, the user will see a visualrepresentation by the program using the VfT program module, of thesimulated transaction. For example, the program may display a money-bagicon on top of the “My Bank Account” icon, which will grow in size; withtext characters denoted amounts, which are attached to the money bagicon, increasing in amount until the exact amount set by the user isobtained.

At the same time, the program may, for example, cause to be displayed, asmall accounting box attached to the “My Bank Account” icon, which willshow the current balance at the user's Bank, and in second row a rollingamount, increasingly negative (red), equivalent to the debt equivalentof the positive money-bag increase.

Once the vector amount as set by user is reached, the program will causethe vector amount to blink twice within the bag and remain, or somesimilar indication to communicate completion.

Next, the program will display a cylinder icon, for example, over theGas Company icon, with an attached text indicator of the current accountbalance. If an amount is owed, this text will be negative and red, andthe cylinder icon will be empty and its border will be red. If there isno amount currently indicated as owed, a dollar amount in black will bedisplayed (i.e., $0.00) and the cylinder icon will be empty, and theborder will be black. If the Gas Company account is currently holding acredit amount greater than the invoiced amount, that credit amount willshow in green text, and the cylinder icon border will be green, and thecylinder icon will show a small amount of green volume.

During the test, the program will move funds from one entity to another,such that the money-bag icon begins to shrink while at the same time theCapital Asset Vector, will, for example, show an increase in size movingthrough it (i.e., as if something large were moving through a pipe,temporarily stretching its diameter as it moved along the length of thepipe).

Then, the program will display, for example, the cylinder icon over theGas Company icon slowly filling up as the transaction progresses (i.e.,as if water were filling up inside it), with the text attached to thecylinder icon, numerically indicating the capital influx shown on thecylinder icon.

When the transacted amount has completed movement from one entity toanother, the program will display, for example, a second row of textattached to the cylinder icon which remains at the final amount, and athird row of text which will appear showing the accounting of thetransaction (i.e., the net result, either a dollar amount in black(i.e., $0.00) showing the balance paid and the transaction complete withno funds owed, any remaining outstanding balance in (negative red), orcredit (overpay) in green text).

The program will also display, for example, text attached to the “MyBank Account” icon, showing an accounting of the transaction, with thefunds removed from the balance of the bank account.

Note that although the “Test” feature was described using a particulartype of icons, any type of icon can be used, and any type of indicatorshowing a removal of funds from the user's Bank account to the GasCompany can be used. Accordingly, the description of the user interfacewhich displays the movement of the funds in the transaction, is for theuser's benefit while the program tests the availability of the funds inthe Bank Account, and the ability of the Bank to transfer the funds, andthe ability of the Gas Company to accept the transaction, etc.

After the test is completed, the program, in step S121, the user will beprompted with transaction options via a dialog box, to either “Run TestAgain”, “Edit Transaction”, or “Save Transaction”.

In this example, the user may select “Save Transaction”, and the programwill save the Transaction for subsequent execution or future retrieval,review, editing, and/or execution, etc.

In the case of later-date or multiple auto-timed payments, alert noticesof transaction activation may be sent by the program to the user'sdesignated e-mail account, which notice may include a URL to a securesystem webpage, with an interface first requiring the system login andpassword, then assuming successful user-login, the program will providea display of transaction specifics, form windows to take input ofrequired passwords, and provide confirmation check boxes or the like, aswell as “Prepare for Execution” and “Execute Transaction” buttons. Theprogram will record transaction specifics and results to the savedtransaction files as described elsewhere, available to the user at thenext login to the system, updateable automatically to the local-client(i.e., user's PC) the next time the user logs into the system from that(PC) client.

When the user would like to review the details of the Transaction justtested, the user may click on the button at the bottom of theTransaction Workpad, called “Text Summary of Transaction”, whereby theprogram will display a Test Transaction Summary including all therelevant details of the user's Bank Account, the unique code which theCDMX program module assigned to the Test Transaction, which code may bemodified in part at the time of execution to show that the code wastested, and then actually executed (for example, the code may consist ofnumbers and letters, with one letter “T” indicating “test”, and uponexecution an “E” may be added to the code). In this way, the CDMXprogram module may easily distinguish, and the user may easilyunderstand, whether a transaction being reviewed was executed, tested,or both, the Transaction amount, the timing chosen by the VectorCriticals, etc., as well as the details about the Gas Company's bill,payment, etc.

The user may print this if desired. The user may also print textsummaries for either or both the tested transaction, and/or the executedtransaction. The summary of the executed transaction will contain allnecessary information and tracking codes to stand as a receipt oftransaction, which information shall be sufficient to prove payment wasinitiated.

Since the CDMX program module tracks all transactions and the entitieswhich are involved in them, the user-printed text summary provided bythe program, which includes transaction codes, shall be able to identifythe exact transaction details to the customer service professionals atthe real world receiving entities. Since transactions will be executedover traditional and existing secure payment networks (such as ACH,PayPal™, etc.), these receiving entities are already capable ofreceiving the system-initiated transactions. So it is possible that thereceiving entity may not care what 3^(rd) Party (i.e., the system of thepresent invention) initiated a payment and will simply record thepayment along with all others received through the same infrastructure,thus making it easily retrievable for review should the consumer wish toaddress the customer service departments of receiving entities whichwere Vector Destination Entities in the system-initiated transaction,and discuss specific transaction details such as amounts and timing ofpayments, etc.

Now, if the test was successful and the simulated results satisfactorysuch that the user would like to execute the Transaction, the user mayclick on the “Prepare for Execution” button on the bottom of theTransaction Workpad. The program, in step S122, will cause theTransaction Workpad to shrink, for example, withdrawing to the upperleft side of the display screen, and showing only the Transactionentities and the vector connecting them, but in much smaller form.

Below this window, the program will display the Transaction Name assaved by the user, and below the Transaction Name, an accounting ledgeror Transaction History, for example in downward-to-current chronologicalorder, showing all historical Transactions (if there are any) made usingthis particular assembled transaction and vector.

Below this window, the program will show a final accounting entryshowing the date and amount of the present Transaction, as “About to beTransacted”.

The program will display a “Lock in this Transaction” button at thebottom of the display screen, and the user may then click on thisbutton. Upon pressing the “Lock in this Transaction” button, the programwill display a vertical rectangular window, for example, which will showdimmed components of the Transaction, including a list of items thatneed to be checked and verified in all necessary aspects (i.e.,sufficient funds in the user's Bank Account, the availability of the GasCompany system online, etc.).

The program will then proceed through the checklist of items to bechecked and verified, with each item lighting up upon review by theprogram (i.e., the item will turn red if there is a problem, or green ifthe transaction can proceed).

Once the program has checked and verified all aspects of the Transactionas positive, the program will display a “Transaction Locked In and Readyto Go” message or the like, as well as a confirmation icon, in stepS123, and the program will then activate a displayed “Execute thistransaction” button that is associated with the Transaction Workpad onwhich the transaction lies, or the like. Placement of the button on thedisplay should be such that the user correctly associates this buttonwith the transaction concerned, and does not confuse it with any othertransaction or activity in the system. (This button would havetransitioned to a state of active availability for use at the user'sdiscretion. This transition may be recognizable in changes that includesuch things as audio, visual, animation, or state changes in brightness,color, shape, dimensionality, placement, and the like).

The user may then click on the “Execute this Transaction” button, andthe program, in step S124, will clear the contents of the verticalrectangular window and will display a new list of execution items forthe Transaction as well as a vertical progress-downward highlighted bar.As each item (such as “Send Pre-Notification of Transaction to GasCompany System”, “Partition Set Amount from User Bank Account”, “ReleasePartitioned Amount”, “Confirm Receipt by Gas Company”, etc.) isperformed and verified by the program, the completed item will turngreen, for example, and get a checkmark to its left, for example, andthe progress bar will continue downward on the list. Note that for eachTransaction Entity chosen, the program will access a pre-determined setof instructions of items to be verified, depending on the transactiontype, object-entity (i.e. remit, request, buy, sell, etc.), andparty-entity (i.e., Bank, Insurance Company, Utility, etc.) involved.

During Execution, the shrunk transaction and vector assembly will repeatthe graphic display described in the test, in conjunction with eachactual proceeding step in the execution process. Thus, for example, whenthe Execution process runs “Release Partitioned Amount”, the moneybag asdescribed during the Test procedure, will begin to drain and movethrough the vector, etc.

The program also provides a unique Transaction Number to the Transactionwhich Number can be tracked by all the parties to the Transaction (i.e.,Bank, User, Gas Company).

Upon completion of the Transaction and the assignment of the TransactionNumber, the program, in step S125, will display a ComprehensiveTransaction Record which will include a diagram of the vectorTransaction, all account details, institutional contact information, andthe specific official transaction-system time-stamp data, as well as theTransaction Number.

The user may then print out the Comprehensive Transaction Record for theuser's records, or simply save digital copies locally or on the server(network records would automatically be kept according to bankingregulations.). The user may also export transaction specifics to anymajor financial accounting software (such as Quicken™). Conversely, itis envisioned that major financial accounting software will have thecapability to execute the Transactions enabled by the present inventionfrom within such applications, with all summary data being returneddirectly to the financial software's logs, etc.

The saved Transaction becomes a template for future transactions,whereby the user can reopen the saved Transaction and perform anothervectored transaction at a future date, needing only to confirm theCriticals, and execute. Likewise, copies of existing saved transactionsmay be made, in order to rapidly edit these into new transactions whichare similar to the original.

An example of this may be if the user wishes to create a second “Paymentto Gas Co.” transaction assembly, but with a different remittance entityin place of the original Bank account. The user would first click onceon the existing saved transaction file icon, then, going to the “File”pull-down menu, select “Duplicate Transaction File”, where the programwill produce a carbon copy of the existing saved transaction, its nameautomatically adjusting to reflect that it is not the original, but acarbon copy. The user may then double-click this carbon copy, and theprogram will allow the user to edit, replace, and adjust any or all ofthe entities. The benefit to the user in doing this is that all settingsfor entities in the carbon copy will remain the same as they were in theoriginal (although they could be changed at the user's discretion), sothat, for example, the Vector direction would already be properly set asrequired to make the remittance to the Gas Co.

Note that although the Transaction is described as being tested prior toexecution, the user can set up a Transaction and then proceed straightto execution, thereby skipping the Test function.

Although the Traditional Simple Transaction uses only a small portion ofthe full capability of the distributed finance system consistent withthe present invention, it is likely that this function is one of themost readily available to users at the current time. Because thedistributed finance system consistent with the present invention is athird-party platform, a user can maintain a single account, and via thesame account and login system, monitor any number of diverse accounts,whether bank accounts, credit card accounts, utility bills, variousloans, investment portfolios, etc., and build, test, and executetransactions from any or all of them as desired using empiricaltransaction party-entities and transaction object-entities as describedin part herein.

Traditional Compound Transaction

In one embodiment consistent with the present invention, a TraditionalCompound financial transaction can be assembled, tested, and executed,similar to the Traditional Simple transaction. Essentially, as statedabove, the Traditional Compound Transaction involves two entities whichare not normally connected in traditional financial systems. Since theTraditional Compound Transaction can take many various forms, threeexamples will be described. Further, since the user interface has beendescribed in detail with respect to the Traditional Simple transaction,the user interface will not be described in detail hereafter.

EXAMPLE 1

Once the user has logged in, been authenticated, and has brought up a“New Transaction”, and is at the blank Transaction Workpad as describedabove in the Traditional Simple Transaction, the user may then continuewith the same process as described in the Traditional SimpleTransaction. For example, the user may wish to choose “My Stocks”, andby mouseovering the “My Stocks” icon, the program may access the user'saccount and obtain and display any real time data related to theaccount.

In one example consistent with the methods and systems of the presentinvention, the user may chose “My Stocks”, and “My Auto Loan”—thecurrent auto-loan in question having, for example, 18 months of paymentsleft to make. The user may now build a transaction using these two iconsand a Transaction Object icon—“Sell”—to sell whatever stocks the userwishes, and then use a Capital Asset Vector to direct the liquid capitalto pay out the Auto Loan in full—as a single programmed transaction,with everything recorded and managed by the distributed finance programof the present invention.

As with the Traditional Simple Transaction, the user may assemble thetransaction, test it, modify it, and then execute it as one transaction.Thus, there is no need to have interbroker or intersticial partiesinvolved in the financial transaction.

Note that the MaQs program module will take care of communicating withthe marketplace and executing the commands that are structured using theVfT program module and coded using the CDMX program module. The VfTprogram module will keep a viewable record of all transactions, updatedby information fed from the MaQs program module and the CDMX programmodule. Also, the VfT program module will save the transactions and makethem available for review and tracking purposes, to analyze amounts,counterparty account numbers, times, etc.

EXAMPLE 2

In another example consistent with the methods and systems of thepresent invention, under the “New Transaction” menu, the user may choosean option such as “Query”, and may choose from a number of options suchas “Loan”, “Insurance”, etc. In this case, the user may choose “Loan”,at which point the program will prompt the user to enter various loanparameters (i.e., “Set Loan Parameters” option). Once the user entersthe parameters, the program will query the marketplace (i.e., banks,credit card companies, etc.), or the distributed capital systemcommunity (to invite a multitude of lenders to participate insyndicating a loan), for loans of the user's specifications, and returnreal-time information on interest rates, credit data, etc. If the userdecides to apply for a loan, the user may do so, and may do so on-line,either with a single counterparty such as a bank (which would constitutea Traditional Simple transaction), in the traditional manner, or with amultitude of lenders, in syndicate fashion, automatically orchestratedby the present program of the invention (which would constituted aCollaborative Simple transaction). Regardless of which approach is usedto secure the loan, this initial activity is in this example hereafterlinked to successive transaction activity, and becomes a component of aTraditional Compound transaction. In this way, the transaction types arenot restricted to being used only as independent transaction types, butmay be combined to achieve whatever streamlined result the users cancome up with.

Assuming that the user is granted a loan on-line, for example, and hasfunds available at the bank or credit union etc., the user may thendeploy the loan funds to pay off the user's credit cards or child'scollege loan, etc., for example. The Transaction is similar to theTraditional Simple transactions in that the user brings up the “My Loan”icon, the “My Credit Cards” icon, and “My College Loan” icon, connectsthem with a “Transaction Object” such as “Capital Asset Vector”, anduses the loan funds to pay off the credit card and college loan bills(see FIG. 18).

Note that funds can be split from the Loan using more than one “CapitalAsset Vector”. The program can be directed to execute the emanatingCapital Asset Vectors simultaneously, or in series. Testing andexecution requests could be instituted for all the pending Transactionsat one time.

Further, one of ordinary skill in the art would recognize that this typeof Transaction can be accomplished between any entity which isinteracting with a number of different targets (i.e., an employer payinghis employees their salaries, etc.).

EXAMPLE 3

In yet another example consistent with the methods and systems of thepresent invention, the user may program speculative activity, where asin Example 1, the user wishes to “Sell” stocks, but only at a particularprice. The program will provide the user with an option to set theparameters of the sale (as in Example 2, where Loan Parameters are set).Since the stock price can be obtained in real-time by the program anddisplayed for the user, the user will know if the stock price is lowerthan the price at which the user wishes to sell.

Accordingly, the program can provide the user with options to sell thestocks when the price the user wants is achieved, with the programtesting the transaction in the marketplace at any interval, inreal-time, as programmed by the user, or to sell the stocks at aparticular time or date, whatever the price of the stocks is at thattime, etc. (i.e., “Set Sale Parameters” function is provided as part ofthe menu, similar to that of “Set Loan Parameters”).

The program also incorporates functions like trailing-stop-loss monitorssuch that users could preset the system to invest in certain financialinstruments at a certain triggered event, and have the systemautomatically exit the investment, delivering profits back to the user'sbank account accordingly, should the exit-trigger be tripped.

Accordingly, the user may program any type of speculative (ornon-speculative) activity which can take place at a future time,according to the parameters set by the user.

In addition, the program, upon automatic execution of the Transactionwhen the parameters are met upon the “Test”, the program canautomatically (or upon request by the user) notify the user that theprogrammed Transaction has occurred, by providing a message to the userwhen the user logs in, or an e-mail to the user on the user's computer,or to his mobile telephone, pager, or mobile organizer, etc.

Thus, the Transaction can be performed remotely, securely, andautomatically through the distributed finance system of the presentinvention.

Collaborative Simple Transaction

The difference between the Traditional Compound Transaction and theCollaborative Simple Transaction is that the former makes it possiblefor a single customer to manipulate multiple single-user accounts andtransactions together in one place, whereas the latter creates thepossibility of multiple customers participating in the same accountand/or transaction. Methods and systems consistent with one embodimentof the Collaborative Simple Transaction is described below. Note asdescribed above in Example 2 of Traditional Compound transaction, thatthe transaction types can be combined as users see fit to createextended transactions that achieve their needs.

EXAMPLE 1

In an example of a Collaborative Simple transaction, the user may set upan investment opportunity or other fund-raising activity, which isextended to other system users. The “investment opportunity” is set upby the user on the Transaction Workpad, similar to what is described inthe Traditional Simple Transaction example, except that this type oftransaction is offered to a predetermined number of users, or otherwisedefined or constrained such as with a ceiling amount of desiredinvestment funds (for example, for raising money to donate to a charity,or inviting others to invest in corporate securities).

The user can then use the menu options, for example, to create the listof users (“invitees”) to whom the user would like to send the“opportunity”, or in another example, to choose variable constraints andoffer access to the opportunity, to any user who meets the presetconstraints. The distinction of the type of user participating in thiskind of transaction may be visibly displayed on the user interface,perhaps with the named, specifically invited parties represented with asquare object (FIG. 19), and parties unnamed but qualified per presetconstraints represented with circles (FIG. 19). The CDMX module of theprogram will provide a unique parent transaction number for theoffering, and then for each invitee user name a child code; also, CDMXwill generate unique offering transaction invitee passwords fordistribution to each invitee listed.

In addition, the user can access the menu and pull down Options, wherethe user can adjust various constraints on the transaction, for examplea time limit on the acceptance and/or participation in the transaction(i.e., 30 days).

Once the invitees are confirmed by the user, the program willautomatically notify those users' system accounts, such that the nexttime those users log into their accounts, they will see notice of theoffering opportunity, perhaps in the form of a blinking icon, etc. Uponacknowledging, with a mouse-click for example, the notice of invitationto participate in the opportunity, the system will request input of thespecific offering transaction password. If the user does not have thispassword, the offering will not be accessible. The invitees will receivetheir individual offering-specific passwords either via e-mail, (or byphone, post, etc.). In this way, the user owner of the transaction wouldhave to mistakenly identify an invitee TWICE in order for the wrongperson to accidentally gain access to a transaction that was notintended for him or her (once in identifying the said invitee to thesystem, and once again in communicating with the invitee, presumably bysending e-mail with the specific offering transaction password to thesame wrong person).

In the case where the right invitee is notified of the offeringsuccessfully by the system, but the wrong person receives the offeringspecific transaction password, even if that person has a system accountand logs in, there will be no notice of the offering invitation, and sothe password will be useless. Conversely, if the system-identifiedinvitee is mistaken and the wrong person receives invitation notice ofthe offering transaction, that user will not have the necessary passwordto access the opportunity. In this way the system is designed to besecure, and to limit by design inadvertent, unintended, and evenundesired financial interaction.

If access is achieved via the correct system account being notified withthe subsequent correct specific invitee offering password beinginputted, the user will be given access to the “investment opportunity”by the system, via for example, during mouseover, or by right clickingon the mouse to pull up a menu, or dialog box, or the like. Thetransaction details will be provided in real-time by the program, andthe program will provide all information to the user (i.e., amountrequested, date requested, other investors, amounts other investors haveprovided, etc.).

After review of the “investment” transaction details, the invitee maythen “accept” or “decline” the “offer” of the “investment opportunity”.If the invitee declines the offer, then the program will delete the iconfrom the Transaction Workpad screen and in one example, provide theinvitee with a means to send a comment to the offering party. The usermay also exit the transaction without accepting or declining in theevent the user wishes to review the transaction again at a later date.

If the user wishes to accept the transaction, the user can click“accept”, for example, and can then proceed to set up a transactionsimilar to that of the Traditional Simple transaction, where, forexample, the user accesses a bank account to remove money to pay anentity—in this case, the “investment opportunity”.

As with the Traditional Simple transaction, the user can Test thetransaction and Save it. Further, the user can set up a payment schemeto pay into the “investment opportunity”, similar to the way that theuser would set up a payment of a bill from a store using funds from hisbank account or mutual funds account etc., which may include set orvariable amounts remitted at regular or random intervals. Once the fullamount is paid into the “investment opportunity”, the program will closeor make unavailable the icon, and the user will have a transactionrecord of the amount paid into the “investment opportunity” similar tothat obtained when a bill is paid. This investment opportunitytransaction event may not be re-usable in terms of investing again at alater date, however that transaction file may remain on the inviteesclient and be updated with real time information about the investmentasset. In this way, even a one-time transaction event may be updatedwith real time information.

EXAMPLE 2

In another example consistent with the present invention, two systemusers may wish to collaborate in a purchase on-line. The purchase willrequire a number of different amounts of funds from each one or multipleof the two users banks accounts, credit cards, etc., to remit to thethird person selling the item.

However, unlike e-currency systems, the seller does not need a specialaccount to receive collaborative transactions, since the program candirect, via the MaQs program module, payments to existing accounts viaexisting infrastructure.

The transaction is built much like in Example 1, where a “purchaseopportunity” can be built where a first user can invite the second userto pay into the “purchase opportunity” until collaboratively thepurchase amount is reached. At that point, the first user can “invite”the seller to sell. To achieve this the first user will have the“purchase opportunity” automatically be sent to the seller via theprogram of the system, and then separately notify the seller either viae-mail, verbally, etc. of the specific opportunity password. Note thatto participate in this kind of transaction users must have a systemaccount (otherwise the double-secure approach to authenticatingparticipants is difficult to achieve). The CDMX module of the programwill follow each transaction to ensure that they are conducted securely.

EXAMPLE 3

In another embodiment consistent with the present invention, Example 1can be used one step further, with a foreign currency exchangecomponent. For example, as shown in FIG. 19, the “investmentopportunity”, identified as icon 1 on the Transaction Workpad, can besent out to four potential participants, identified as icons 2-5. Theuser can set up a foreign exchange component (identified as the verticalbar between icon 1 and the user (large bank account icon at left)),where any one of the entities to the transaction can supply funds in onecurrency to have it automatically converted into another currency. Hereis another example of different transaction types combined to perform asingle larger transaction. For currency exchange capability, see belowin the Collaborative Compound example.

Collaborative Compound

This transaction is the most sophisticated of the four embodiments, andthe one for which the system was primarily designed. In CollaborativeCompound transactions, millions of users, for example, can be united intheir pursuit of their financial goals. As stated previously, inCollaborative transactions, both sides of a transaction are consideringthemselves to be customers, and in doing so, fulfill each others'provider roles. Often the customers have no direct awareness of eachother, and the present invention is simply using the CollaborativeCompound embodiment to make the transaction more efficient or lesscostly or both.

There are currently no transactions today which follow this model, thusthe following example is illustrative of a Collaborative Compoundtransaction.

The Collaborative Compound transaction consistent with the presentinvention is described in more detail hereinbelow. In CollaborativeCompound transactions, the program utilizes all the major programmodules, such as the VfT, SVR, CDMX, and MaQs program modules.

Further, although the first example provided below involves an exchangeof currency, note that this can be accomplished in any of the differenttransaction types—from Traditional Simple to the present CollaborativeCompound. For example, a Traditional Simple transaction involvingpayment of a bill can be conducted by paying an entity in France inFrench Francs (or Euros) for an item, and exchanging U.S. Dollars forthe Francs (or Euros). Thus, currency exchange is not the sole provinceof the Collaborative Compound example.

EXAMPLE 1

Thus, in one example consistent with the present invention, and aspreviously described briefly with respect to Collaborative Compoundtransactions, a user's company may require

British Pounds for certain activities. The user will access the systemwebsite and build a “Change Currency” transaction in step S200 of FIG.20, on the Transaction Workpad, using the steps to assemble thetransaction using the VfT program module, as described, for exampleunder the Traditional Simple transaction. Once the user has built thetransaction, the user can test, and execute the transaction if desired,as has been previously described.

When tested, the program will query, using the CDMX program module andthe MaQs program module, to obtain real-time market currency rates instep S201, country, or counterparty data, if the user has indicated thathe cares to know such info, and it is available, to present the userwith the information such that the user can make the determination ofwhether the user would like to execute the transaction.

If the currency exchange rate is not what is desired by the user (i.e.,the cost of British pounds is too high), the user will be able toprogram the transaction such that the program can keep querying themarketplace at scheduled intervals until the currency reaches a certainexchange value, or the user can program the transaction to occur on acertain day, etc., as has been described previously with respect toother simpler transactions. The scheduled transaction is designated apassive-fill or passive type transaction by the program by default,unless indicated by the user to be performed immediately (i.e.,real-time), or by event trigger, which is the fixed type.

If the user decides to execute the transaction in real-time in stepS202, the program will invoke the CDMX program module to codestamp orassign a unique transaction number (i.e., parent code) in step S203 totrack the transaction through the system. The program will preserve therecorded information regarding the transaction in encrypted form usingthe CDMX program module, and confirmation data is passed back to the VfTprogram module by the program in step

S204, which provides this information to the user via the userinterface. Note that in a real-time designated transaction, funds wouldnot be removed from the user's accounts in step S205 upon execution ofthe request, but after fulfilling the request (i.e., matching ofcounterparties or assignment of match codes as described below), suchthat execution instructions to the relevant account(s) could be sentimmediately (i.e., instructions are not possible until match-pairing isresolved).

Once the program has codestamped the request, the program invokes theMaQs program module, and the SVR program module to execute thetransaction. Once the MaQs and the SVR modules of the program areinvoked, using one of the major algorithms, such as an arithmetic meanor an algorithmically calculated separator, the SVR program module willmatch counterparties to achieve the desired transaction in step S206.

In particular, the transaction vectors are separated according todirection and amount type (e.g., currency pair) and ranked by value. TheSVR program module then proceeds to cross-match according to the varyingalgorithms described previously.

As stated previously, if an amount is originally classified by theprogram as active-seeking, the program will seek to fulfill the requestwith a single counterparty match amount. Further, if an amount isoriginally classified by the program as passive-seeking, then it will bereduced by active-seeking amounts until it falls below the mean and isreclassified to become an active-seeking amount itself, after which itis filled and the transaction is completed.

Thus, the matching of a request to exchange dollars for British pounds,and a request by another user to exchange British pounds for dollars,can be matched using at least one of several algorithms. Regardless ofwhat algorithm the program uses for the exchange (and this algorithm isprogrammable), the SVR program module will always produce counterpartymatch-pairs.

The program will match a request for British pounds by the user with amatching request for U.S. dollars by another user holding Britishpounds. If there is a larger amount on one side than the other, andthere is a non-zero remainder left on either side after a match is made,then the program matches the remainders on another pass through thesystem. For example, as a large transaction passes through the system,the SVR program module will break up the transaction amount into anumber of pieces, and match each one to a different counterparty insuccessive transaction passes through the system.

The CDMX program module will be invoked to codecycle and track theindividual parties (tag the match pairs) through the counterpartymatching resolution (vector-spreading) process in step S207, and tocreate several additional child-codes to track the different orsuccessive pieces of the transaction through the matching process, andmake the transaction pieces traceable to the parent transaction, untilall remainder amounts are matched or resolved. Each of these codes arelogged in an accounting tracking ledger by the CDMX program module, andsent to accumulate in the Codematch Aggregator (further described below)in step S208. After the matches are made, the CDMX program module willreassemble the transaction pieces, prior to payment execution, such thatthe end result is the accomplishment of the desired transaction.

Note that the system does not handle each transaction to completion, instrict serial fashion, but will push successive transaction requestsinto the mix, or interlace the transactions, even while a currenttransaction is still in the midst of being fulfilled.

Since the SVR program module handles multiple transactionssimultaneously, the matched pairs will have a multitude ofcounterparties.

Thus, the program invokes the Codematch Aggregator function of the CDMXprogram module for collection (aggregation of same-user transactedamounts), and netting (amounts are netted) in step S209, before theprogram invokes the MaQs program module to execute the funds transferinstructions from the user's account to the appropriate user-destinationaccount, which sum equals the full, originally intended transaction,performed over the existing financial systems infrastructure. Thus, theCodematch Aggregator program, may, according to programmed setting, waitto activate the Bank Multiplexer program so that the transfer of fundsto the user account can be batched in step S210. The CDMX program modulewill log the confirmation and tracking information of the executedtransaction.

In SDEX (real-time, immediate transfer) transactions, instructions willbe executed to user accounts after counterparty matches are alreadyexecuted. In CDEX (fixed and passive-fill) transactions, user accountsmay be initially remitted to a system-owned account (see InvestmentEngine below), for holding, during and after the time counterpartymatches are resolved by the SVR program module, until the preciseuser-indicated transaction takes place. In the event that thetransactions involve currency conversion, and are not designated asspeculative by the owners of such transactions, the system may at itsown programmed discretion, draw down funds immediately for holding inthe base currency, or convert and hold in the target currency, until theuser's prescheduled transaction comes due and calls for the funds.

As stated with the Traditional Simple transaction, the program notifiesthe user of the completion of the transaction, and the deposit of thetarget currency to their account, and the debit of the correspondingamount in their currency, plus any fees from their own account, viamessages within their login account, e-mail, or by phone, cell phone,fax, or any other medium desired. Fees debited for the transaction arechanneled to the system-owned account by the program, as profits.

EXAMPLE 2

As shown in a second example consistent with the present invention, inFIG. 21A, Enterprise A's−44 amount is an active-seeker, which theprogram cross-matches to Enterprise A's+120 in FIG. 21B, creating a 44zero-sum pair, and leaving a system remainder of Enterprise A of +76(see FIGS. 21A and 21C).

The program active-seeks Institution B's+32 to create a 32 zero-sum pair(see FIG. 21A), leaving Institution B's−88 in the system, which theprogram immediately matches with the active-seeker Bob+12, creating a 12zero-sum pair and leaving Institution B's−76 in the system (see FIG.21C). The program creates for the Enterpise A+76 and Institution B−76,the final zero-sum pair for the period, leaving the system empty(confirming the zero-sum for the universe) (see FIG. 21C).

Thus, the Macro Ledger zero-sum pairs are listed in FIGS. 21A and 21C,and when a zero-sum pair has the same counterparty on both sides, it canbe eliminated by the program, producing the empirically reducedMacro-Ledger of FIG. 21C. The empirical Macro Ledger of FIG. 21Cdisplays the most efficient capital vectors (amounts and directions). Ifall the amounts were transferred independent of netting, 164 units ofcapital would move. If single party netting is used, 100 units ofcapital move (88 from Institution B to Enterprise A, 12 from EnterpriseA to Bob). If Spread-Vector netting is used, only 88 units move (asindicated in the macro empirical ledger below Institution B moves 12 toBob, and 76 to Enterprise A). This minimum capital movement stillsatisfies the net ledger account for each party in the universe (bysumming the values in each of the individual ledgers for Enterprise A,Institution B, and Bob).

EXAMPLE 3

In another example consistent with the present invention, on a largerscale, instead of a single user changing funds into British pounds, acountry, like the United States, could pay the United Nations US$4million in back dues, converted to Euros, for example, to be depositedin a

Geneva bank account. The present system can execute such a compoundtransaction and match the individuals and business in Europe (that holdEuros and are seeking Dollars) with the request for Euros by the U.S.,to resolve a perfect collaborative match among thousands or millions ofunknown counterparties. The present system's efficacy is not limitedstrictly to currencies, but to anything that may be treated as afungible instrument of trade.

Note that if the system does not have enough resident liquidity to meetthe needs of a currency exchange, or any transaction, the program canautomatically check the marketplace and channel conversion requests totraditional banks to meet the requests. This capital infusion would betransparent to the users, excepting the pass-through of anytraditional-market fees that would result. It is conceivable, in theevent of a liquidity crisis, for conversion requests to not be met, andlikewise, that the general marketplace as well would not have anyonewilling to supply a target currency.

In other words, the system described herein cannot avert liquiditycrises, however the program can give early warning of such things givendaily volumes monitoring, etc., and due to the fact that thetransactions can be programmed and scheduled (passive-fill), some degreeof moderation may result as the system could be programmed to executepre-scheduled passive-fills during periods of slackening liquidity.

Furthermore, due to the fact that Distributed Funds Transfer (DFT)(described below) is enabled by this system, a very early warning ofmass-market worldwide liquidity crises may result since the system iscapable of bypassing regulations that stem from the politics of capitalflight (which create a drag on the free flow of capital), and systempersonnel may notice more clearly, the initial localized liquiditycrises that would occur from people trying to export capital from acountry, and not being able to use the system's DFT function because ofthe lack of parties demanding the would-be capital-exporters' basecurrency, and not because of regulatory restriction, etc.

EXAMPLE 4

In another example of a Collaborative Compound transaction consistentwith the present invention, an exchange of capital funds can be madebetween two companies, self-selecting each other, or randomly matched,which have capital management needs that are complementary to eachother. If for example, an American company wishes to repatriate RMBprofits earned in China, back to the US (as US Dollars), there arelikely to be restrictions on transferring funds out of China. And if aUS company wishes to have a supply of US Dollars converted to RMB forthe sake of new investment in China, there are likely to be restrictionson bringing in new capital.

The SVR program module, executing a Distributed Funds Transfer process,could, given proper settings of target bank accounts, simply resolve avector schedule that comprised of two domestic transfers, one in eachthe US and China, to each the opposite company's accounts from the localcompany's account. At face value this would appear to be twoindependent, unrelated domestic movements of funds, but as a macro eventwould amount to the two companies swapping their hard currencies via adistributed system. In this way, the two companies could each achievetheir objectives to move money across an international boundary, butwithout the difficulties, notice, cost, and possible restriction oninternational capital movements.

If the immediate request date cannot be met or the amount of fundsfilled for some reason, the program will prompt the user to wait until asystem-suggested date, or to cancel the transaction for a later time.Once the transaction can be executed, the funds are drawn from the bankaccounts of both parties to the transaction, and the program will fillthe requests and remit the amounts in the target currency to the users'bank accounts.

Investment Engine for Profit and Philanthropy

In one embodiment consistent with the present invention, at the user'sdirection, or, for passive-fill request types, the program—via the CDMXand MaQs program modules—will aggregate distributed capital flowsthrough a revolving door holding account, with funds being used totemporarily hold risk-free or low-risk investments.

As stated above, the passive transaction type is the default type, andis characterized by the user indicating that the transaction must occurby a certain date. This means that any time up until that date may beconstrued as a date which is acceptable to initiate, execute thetransaction, and use the capital. Accordingly, the system can pull thefunds of a passive-fill transaction, and hold those funds in the accountfor short-term investments. Further, for certain immediate transactions,such as currency exchange, the system may charge a fee premium.

Specifically, as stated above in the Collaborative Compound transaction,when the user initiates a passive request currency exchange transaction,for example, the program (i.e., the MaQs program module) may remove theuser's funds immediately from his account and move the funds to aholding account within the system, and the funds—along with other fundsfrom other temporarily held accounts—may be invested in money marketaccounts, or savings accounts at traditional financial institutions,etc., which have low or zero risk (because the funds must be returned tothe owners or sent along the way to finishing the transactions theystarted out completing), even if the owners have given their approvalfor investments.

The program automatically pulls market data and checks what types offinancial instruments are available within the necessary riskparameters, and determines the opportunity cost of capital for eachchoice (i.e., cost of entry, exit, and capital requirements). Theprogram then checks the rate of capital vector flow and egress into/outof the system and the rate, as well as the rate of capital vector flowinto the codematching system, and determines the “optimal” capitalexercise option which provides the best return for the required systemliquidity level (i.e., rate of capital drawdown by the Bank Multiplexingfunction, and the system desired rate as called for by the CodematchAggregator function).

Among the types of zero or nearly zero risk options which generate verysmall returns on an individual scale, but when multiplied by millionsand millions of times over a year, for example, would aggregate tosignificant amounts of generated income, are: aggregated funds into abank account held by the system for overnight interest income; purchaseof secured loan portfolios of AAA ratings; purchase of U.S. Treasurieswith leverage, selling them for cash, putting the cash into a bankaccount for interest income; purchase of U.S. Treasuries with leverage,selling them for cash, and lending the cash to a AAA rated corporation;and buying U.S. Treasuries with leverage, lending to a Hedge Fundovernight or longer, etc.

When the counterparty matches are scheduled to take place, or when thedue dates are coming due and execution instructions will soon call thisdiverted capital, the program waits for matches to occur, then theprogram remits the funds where they need to go, albeit from a sourceaccount that is owned by the system, and not the original user'saccount. Individual accounts may be used to generate this investmentdirective, or a percentage of the aggregate of capital flowing throughthe system can be used. The user may know or not know that the money isbeing used for investments.

Note that when the system requires capital return to complete a usertransaction, instead of unwinding the investments in place, made bypreviously diverted funds, the program will divert newer incomingcapital to fill the user transaction. When the investments are returnedto the system, they are also available as new capital to fulfilltransactions.

The profits engendered by the investments can either be returned to theuser by the program, if the user so directs (i.e., the user can set up atransaction to take place at a later date, authorizing the funds to beremoved immediately and placed in a money market account until thetransaction takes place, with the profit being returned to the userwhile the initial transaction amount moves forward to be executed); orthe profits can be directed by the user to be, perhaps aggregated, andused for philanthropic purposes. The system profits can also bereinvested automatically, to aggregate funds for capital purchases toupdate the system, or for philanthropic purposes at a later date etc.

Because the program tracks and executes everything, investments could beheld indefinitely, with new incoming distributed source funds beingdeflected by the program to pay for prior source purchases, and thisdeflection (shifting) of funds does not increase systemic risk,because 1) most purchases are made online with a credit card, and 2) thepresent system can easily require pre-allocation of usable funds into aone-way account.

Once distributed-source funds are used to generate profits forphilanthropic reasons, particulate tax-credits can be automaticallyissued back to each source by the program, and further, the program cangrant allocation votes commensurate to each particulate amount.Allocation votes allow each participant to have a democratic say in howthe philanthropic funds are to be used, with available optionsorchestrated by professional philanthropic experts. Further, the presentsystem could issue tax credits, based on a weighted average from therecord logs, from its philanthropic activity back to the users as abenefit for the capital they allowed the system to use.

Thus, other financial services in the investment arena, can be offeredto the users. Further, if the user does not wish to use his own money intaking advantage of the investment opportunities, the user can perhapsborrow money from a financial institution to partake of the investmentopportunities.

Capital Infusion

In one embodiment consistent with the present invention, as statedabove, the MaQs program module periodically automatically checks thesystem to ensure that there is enough liquidity to readily facilitatethe proper functioning of the system. If the system is severelyasymmetrical (based on the arithmetic mean, or the like, or afluctuation of more than 10 percent, for example, variation with theOppside) the program will automatically use new capital by openingitself to traditional banking channels such as JP Morgan, which may beinterested in a new source of business, or in the event that the ownersof the system wish to put some of its own capital, system profits couldbe used (i.e. invested in the operations of the business).

This capital infusion would be transparent to the users, andcodematching would continue without stopping with any unmatched requestssimply passing through the system over and over until filled.

Credit Operation

In another embodiment consistent with the present invention, in additionto a philanthropic motivation for the aggregated funds or profitsengendered in the above operations, the system would encompassmore-sophisticated functions which can become entire systems ontothemselves.

For example, the program could offer a credit service operation,extending credit to a system user, group, small business, or even largecorporation, and issuing credit and/or ATM cards, similar to what banksoffer presently (in this case, since the system is tied into the user'saccounts, it can easily perform a credit rating on the user when theuser requests a credit card or credit line or loan); or the creditrating could be generated on a distributed basis as explained below.This credit rating may be generated in conjunction with the CDMX programtracing function of actual payments, rather than relying on 3^(rd) partycredit bureaus such as Equifax, et al.

To get users started with a system-determined credit rating, theevolution of the credit ratings may follow that of Ebay™, wherebyaccount usage would be the primary factor in communicating theuser-rating. However, the basis for the user credit rating could alsoproceed a number of other ways, including being based upon somemathematical equation that takes an existing credit score input toarrive at a non-zero initial rating for each user. The initialcredit-score input could be a formal credit-bureau score, or an adaptedone based on the submitted record(s) of a user's credit card usage,manipulated by the program via some algorithm, to arrive at a range or aspecific number, which would be the initial credit rating that the usercould then use to begin participating in the collaborative environment.

Lending and Microlending

In another embodiment consistent with the present invention, the systemcould offer a direct-lending system where users of the system can rateand lend/borrow from other system users (whether individuals orcorporations), as well as from the system itself if the system shouldhave accounts activated for that purpose.

In the direct-lending system, a user can offer funds to other remoteusers (which may be used in Africa for example) at a defined interestrate and payment schedule, and borrowers can borrow money at a certaininterest rate and payment schedule, and the borrowers/lenders need notbe aware of each other since the program automatically debits theaccounts of the borrowers and credits the accounts of the lenders at thescheduled times and will even automatically execute currency conversionsto repatriate loan repayments.

Another example is microlending. The microlending model architected bythe Grameen Bank Project uses a peer-to-peer network-effect, albeitoffline, and on a very small and local scale.

With the collaborative functionality of the present invention describedherein, microlending can be facilitated on a global-local scale, makingit possible for individuals to easily and swiftly direct their owncapital flows toward any corner of the planet they choose. With thecollaborative object model of the present system supporting the samenetwork-effect peer-relationships (i.e., self-selecting committedindividuals), the potential to bring unprecedented speed and fluidity toinvolvement, commitment, and funds flow to humanitarian efforts, rescueefforts, emergency efforts, etc. is within reach.

Thus, while Grameen Economics deals with micro amounts offline (even iffunds are collected from donors online, the distributions of thedonations happens offline, distributed by a governing organization), thesystem described herein would support collaborative transactions anddirect disbursement at any amount level, whether micro, or massive,allowing users to lean on personal relationships, reputation, andintegrity to win participants (i.e., peers) in the borrowing orinvesting opportunities they offer; and then interact with eachlender/investor directly or as a group.

In the communal-direct approach to borrowing and lending of the presentinvention, the CDMX program module will be tracking everything, and“success points” could be awarded to all participants for aligningthemselves with a successful credit transaction, thus becoming anincentive. The accumulation of these points, displayed in the userinterface by the program, would amount to a distributed credit-ratingsystem, or more broadly, a distributed integrity rating, whereby thenetwork of participants could begin to make assessments about thecredit-worthiness of a stranger, based upon previous record.

This would pave the way for users, companies, etc. to charge higherinterest rates for money lent (i.e., high-quality lenders or investorsknown for being involved in successful transactions can charge a premiumbecause their participation in a deal often provides a psychologicalelement that facilitates further participation by others, and ultimatelysuccess for the transaction), and lower borrowing rates (reliableborrowers will have a superb record of payment, and will enjoy excellentcredit, hence lower rates for borrowing). Additionally, the integritypremium enjoyed by honest and reliable participants in the community(system), may also include advantaged or preferential access or offeringability for investment etc. that others with lower integrity ratingswould not have access to.

Universal On-Line Purchasing

In another embodiment consistent with the present invention, traditionalon-line purchases can be made (i.e., Traditional Simple transactions),where the user can utilize the option of paying with the system eitheras a direct debit from a user account (i.e., bank, sale of stocks etc.,which is set up like any of the previously described transactions), or asystem loan (as previously described), or the system credit card. Thesetransactions can be carried out in real-time, or at a programmed time,which allows the user flexibility in making his purchases.

However, in some cases, currency is an issue where one user is in theU.S., for example, and wishes to purchase an item in another countrywhich is listed in a foreign currency. Using the present invention, whenmaking a purchase, the user may utilize the system to pay for the item,thereby authorizing the system to pay for the item in the targetcurrency and deduct the user's account for the corresponding U.S.currency.

Specifically, after shopping on-line, at the checkout screen on themerchant's website, the user can select “Pay with The system” as thepayment option. The system screen will be selected, and the program willprompt the user for his login and password (a specific password for onlyon-line purchases can be set up as well). The user can confirm hispurchase at the Transaction Workpad screen, and using thesystem-merchant identification code, and any other identification code(such as for the item being purchased, or the purchase order number),can exchange currency as in the above Collaborative Compoundtransaction. The CDMX and MaQs program modules will track the purchaseand execute the transaction, and transfer the target currency funds tothe merchant account, and debit the user's account of funds. The programwill notify the merchant that the funds have been provided and that thetransaction is complete, and will also notify the user of the debit offunds from his account.

ATM Sharing

In another embodiment consistent with the present invention, using aconcept called Quantified Access, non-native ATM cards can use any ATMmachine in any bank-domain and not utilize Plus or Cirrus or othersimilar networks (which would incur fees).

Quantified Access means granting a temporary and quantified amount ofaccess to deduct funds in a bank account not owned or associated orlinked or in anyway associated with the ATM card which draws down thefunds. The permission granted to the ATM card is such that any bank orany bank's ATM will recognize the ATM card as native.

It is conceivable that this can proceed without user permission (i.e.,the instantaneous use of their accounts for temporary insertion of fundswhich are drawn down immediately, hence leaving the account in itsoriginal state). However, regulatory issues may require that the systemusers indicate permission for using their accounts for this purpose.

The process is as follows, a user goes to an ATM machine which is notnative to the domain that his or her ATM card can use fee-free. This maybe in any currency domain as well it does not matter—since the systemcan execute the exchange transaction as required, which process isexplained in detail below.

The user inserts a card, it is validated as a valid card by the ATMcomputer, where the computer checks for validation that the given ATMcard is connected with a valid bank account at a real bank in the world.

Once validated, the user is usually prompted with a screen thatindicates that there will be a charge of $1.50 or some similar amountfor the transaction if it is not a free transaction for a native bankuser.

Since software programs like Intuit's Quicken™ and other accountingsoftware for end-consumers is already capable of downloadingbank-account data over a network, it is conceivable that this accountmonitoring may proceed in real-time. Thus, the system may be set by theusers, to track activity on accounts registered therein. If users haveset their accounts to be responsive in this way, then, as soon as theuser approves the potential fee charge for ATM usage on the ATM screen,the system program will be notified of the pending bank deduction forthe ATM withdrawal, and will take over the transaction, not allowing thebanks to proceed.

First, without canceling the user-session at the ATM, the program willhalt the proceeding at the banks, not allowing a deduction at the homebank, nor allowing cash-dispersal from the ATM.

The program then moves funds from the user's account using the bankmultiplexer program module, to any account X within the ATM domain thatis being used for the current transaction, similar to what may occurgiven the willingness of any owner of such account X within such domain,to lend funds to quantified access for the user to withdraw. The CDMXprogram module updates the tracking logs accordingly. At the same time,the bank which owns the ATM is sent information by the programindicating that the non-native ATM card that was read at the ATM, hasnative-level quantified access to account X.

Funds are immediately dispersed from account X, leaving its balance inthe original state (logs will show an instantaneous deposit andwithdrawal of the same amount), and no fees are charged because the bankrecognizes it as a native-ATM card withdrawal.

Thus, quantified access means that permission is provided by the programto deduct certain defined and limited amounts of funds from an accountthat the user does not normally have access to, such that the bank willrecognize the ATM as a native account. In other words, the ATM card istemporarily and for a quantified amount only, being recognized as an ATMcard linked to account X.

Now, since the cash dispensed at the ATM is not really physically takenfrom user accounts, and is just deducted electronically, it may not benecessary to actually have the system move funds into any X account; anygeneric account at the Bank should work, which means that if the systemopens and maintains a bank account in any and all bank-domains, then itcould simply use its own bank accounts and grant quantified access thatway, essentially offering all the system users a shared account, thusbypassing ATM fees in any and all domains, anywhere worldwide.

Distributed Funds Transfer

In another embodiment consistent with the present invention, the presentsystem can make any conventional funds transfer a distributed fundstransfer, dispersed to a thousand different directions in small amounts,shifted via transitive resolution and collected at the destination assmaller-amount transfers that would converge to sum to the originalamount. The SVR program module could do this such that the dispersionpattern is undetectable, which implies certain security or safetyinherent in the system since external observation of the transfers wouldnot yield any insight into the method of dispersion.

First, to offer a definition, a funds transfer, or electronic fundstransfer (EFT) is the intentional targeted movement of funds over anetwork, from point A to point B.

A distributed funds transfer (DFT) is a method for using existing fundstransfer networks, to the effect that a macro zero-sum awareness of thefunds-flow universe allows for a vector polarization of funds-flowtoward and away from two chosen points (i.e., the sender and receiver)such that the net at each the sender and receiver is fulfilled accordingto the directions of the original intended transfer, WITHOUT fundsmoving directly from the sender to the receiver.

Since communications transmission speeds over global interconnectednetworks approach instantaneous, it is possible for awarenesspropagation to provide nearby clients, servers, and servents withinformation about what is being experienced and what is visible toremote clients, servers, and servents. Note that in a network thatoperates at these speeds, “near” may include “global”. Since the presentinvention uses existing infrastructure (which is subject to existingregulations) to execute funds transfer, the funds transfer is verydifficult to predict and track externally.

This means that at the instant a (physically or geographically) remoteentity R makes it known to the network certain information regarding thedesire and intention to move funds from some point A near itself to somepoint B remote from itself in the physical, geographic world, someentity S may be considering a desire and intention to move funds fromsome point F near itself to some point G remote from itself in thephysical, geographic world. In today's world, funds transfers arepursued each independently, in a complete vacuum from any other transferbeing carried out over the funds transfer networks. Only in the event of“netting” (which is a computational approach to reducing total capitalmovement between two parties by summing all in and out transfers to thesame party over a fixed period of time, to achieve a “net” amount thatcan be sent at the end of the period), are multiple transfers consideredwith reference to other transfers.

With the system of the present invention, given risk-definitionguidelines for each participant in the system-network, the program canwatch via awareness propagation, for near-to-far and far-to-near fundstransfer notices, and using preset algorithms at all participatingclients, servers and servents, the program can achieve for example, aredirection of funds such that the total summed distance of all fundsmovement was minimized. This may for example, mean that instead ofmoving funds the long haul from A→B, and also the long haul from F→G,that two smaller transfers F→B, and A→G lower system-wide risk byreducing total amount of capital per time at risk, and fulfills theobligations of all parties.

In the present example, where A→B, F→G switch counterparties to reducetotal capital travel, this is only feasible where the two intendedtransfers are equal. This parity (symmetric) condition stands as athreshold to critical mass, which explains why such a system does notexist today. The present invention solves this parity condition byentertaining all vectors in the universe, and more importantly,successive vectors in the universe. Since funds transfer networksexperience a volume that is constantly rising, it is reasonably reliableto assume that successive vectors will come. The present invention is aunique system for managing fungible transactions that treats thetransactions as vectors that are part of a vector field, or flow,theoretically assumed to be perpetual.

Specifically, as discussed below, the program first receives the user'scommand to send funds, via some funds transfer network. Then, theprogram of the system client/server/servent discovers via awarenesspropagation, an intended funds transfer targeting its own institution orone nearby. The client/server/servent of the present system identifiesdirect communication pathway to that remote client/server/servent, andopens communications. The two clients/servers/servents trade informationabout their intended transfer vectors, recording locally the net vectorposition intended at each target (recall a vector is a 2-dimensionalentity, in this case containing amount information, and directioninformation). (Note: this now means that banking information can becompletely redundantly dispersed, and to a large extent anonymously, orat least in encrypted form, to the extent that it would be virtuallyimpossible to eradicate and destroy financial records; natural disaster,or terror aimed at eliminating assets in the name of equalizing allpeople would become an extremely remote threat to modern society).

The two clients/servers/servents recursively compute optimal transferdirections for any included intended vectors in a given defined periodof time. Note that “recursively” assumes a constant interaction with achanging network population of intended transfer vectors (i.e., thatawareness propagation is bringing every participatingclient/server/servent new information about new intended transfervectors) that can now be included in the distributed transferoptimization process. “Optimal” is defined as the most efficient vectoror vectors as computed in the context and extent of the period-awarenessvector-universe.

Thus, in a Period Distributed (or Dispersed) Funds Transfer, because theprogram can achieve delivery of funds from a specific account A to aspecific intended target account B without directly transferring fundsfrom A to B, the DFT becomes an incredible tool for almost allhigh-value transfer agents, who are worried that their transfer linesmay be compromised by hackers, terrorists, natural disaster, etc.

When periodicity concludes, optimized distributed transfers are executedby the program. Some net vector conditions remain unfilled, or onlypartially filled; and the successive period includes awareness of theseunfilled and partially filled vector conditions. Various preset rules ofthe program hold that older incomplete net vector conditions will befilled first, thus bringing completion to each successive wave ofuncompleted and unfilled transactions.

Thus, the present system brings the same relentlessreroute-until-delivery-is-achieved reliability to fungible instrumenttransfer, as TCP/IP brought to communications via the Internet.

Security and Privacy Issues

Transaction vectors will be encrypted while in the system, providingcomplete privacy to all users of the system. However, vector amounts,directions, and identities may be decrypted separately at the order oflegal authorities. The present invention's program may provide filtersthat recognize and alert system administrators to potential launderingtype or tax evasion type activities.

It should be emphasized that the above-described embodiments of theinvention are merely possible examples of implementations set forth fora clear understanding of the principles of the invention. Variations andmodifications may be made to the above-described embodiments of theinvention without departing from the spirit and principles of theinvention. All such modifications and variations are intended to beincluded herein within the scope of the invention and protected by thefollowing claims.

What is claimed is:
 1. A method conducting financial transactions over acomputerized network, comprising: conducting awareness propagation suchthat capital movement over a participant system-network is optimized. 2.The method according to claim 1, further comprising: receiving a commandto perform a first capital movement from a user at a first financialinstitution; determining by awareness propagation that a second capitalmovement is scheduled at a second financial institution to said firstfinancial institution; trading information on said first capitalmovement and said second capital movement and transfer parametersthereof; determining net parameter positions intended at said firstfinancial institution and said second financial institution; recursivelycomputing optimal transfer parameters for said first capital movement;and conducting a distributed transfer of said first capital movement andsaid second capital movement.
 3. A financial services system,comprising: means for conducting awareness propagation such that capitalmovement over a participant system-network, is optimized.
 4. Acomputer-readable medium whose contents cause a computer system toperform financial transactions over a network, the computer systemhaving a program which performs the step of: conducting awarenesspropagation such that capital movement over a participantsystem-network, is optimized.
 5. A computer system adapted to performfinancial services over a network, comprising: at least one memoryincluding a program having instructions adapted to enable the computersystem to perform the steps of: conducting awareness propagation suchthat capital movement over a participant system-network is optimized;and at least one processor which runs said program.
 6. A computerprogram product for enabling a computer to perform financialtransactions over a network, comprising: software instructions forenabling the computer to perform predetermined operations, and acomputer readable medium bearing the software instructions; thepredetermined operations including the steps of: conducting awarenesspropagation such that capital movement over a participantsystem-network, is optimized.
 7. The method according to claim 1,further comprising: implementing a transaction protocol to monitor andmatch data requirements, and allow unrelated party matching; takingdigital representations of financial vectors and executing a nettingsummation of said financial vectors for said unrelated parties; andexecuting and settling financial transactions for said unrelatedparties.
 8. The method according to claim 2, wherein said awarenesspropagation is conducted such that vector transactions are executed andsettled.
 9. The method according to claim 2, further comprising:performing at least one net capital deduction to an account of a firstuser; performing at least one net capital addition to an account of atleast one second user; recursively conducting said awareness propagationsuch that said at least one net capital addition and said at least onenet capital deduction to accounts of successive users for which one ofmeet and exceed an absolute value of a current net capital imbalance areexecuted.
 10. The method according to claim 8, further comprising:recursively conducting said awareness propagation such that at least onenet capital addition and at least one net capital deduction from useraccounts result in optimizing an iteratively netted capital imbalance.